java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:19:43,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:19:43,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:19:43,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:19:43,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:19:43,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:19:43,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:19:43,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:19:43,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:19:43,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:19:43,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:19:43,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:19:43,077 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:19:43,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:19:43,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:19:43,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:19:43,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:19:43,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:19:43,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:19:43,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:19:43,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:19:43,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:19:43,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:19:43,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:19:43,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:19:43,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:19:43,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:19:43,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:19:43,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:19:43,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:19:43,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:19:43,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:19:43,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:19:43,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:19:43,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:19:43,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:19:43,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:19:43,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:19:43,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:19:43,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:19:43,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:19:43,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:19:43,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:19:43,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:19:43,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:19:43,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:19:43,134 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:19:43,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:19:43,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:19:43,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:19:43,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:19:43,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:19:43,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:19:43,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:19:43,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:19:43,136 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:19:43,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:19:43,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:19:43,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:19:43,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:19:43,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:19:43,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:19:43,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:19:43,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:19:43,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:19:43,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:19:43,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:19:43,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:19:43,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:19:43,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:19:43,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:19:43,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:19:43,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:19:43,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:19:43,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:19:43,193 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:19:43,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01-2.c [2019-09-03 19:19:43,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206478edc/8edc1282cb5f447797406cc06f7ee86f/FLAG6c4b1b361 [2019-09-03 19:19:43,718 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:19:43,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01-2.c [2019-09-03 19:19:43,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206478edc/8edc1282cb5f447797406cc06f7ee86f/FLAG6c4b1b361 [2019-09-03 19:19:44,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/206478edc/8edc1282cb5f447797406cc06f7ee86f [2019-09-03 19:19:44,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:19:44,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:19:44,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:44,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:19:44,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:19:44,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ec451f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44, skipping insertion in model container [2019-09-03 19:19:44,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:19:44,105 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:19:44,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:44,344 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:19:44,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:19:44,491 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:19:44,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44 WrapperNode [2019-09-03 19:19:44,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:19:44,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:19:44,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:19:44,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:19:44,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (1/1) ... [2019-09-03 19:19:44,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:19:44,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:19:44,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:19:44,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:19:44,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (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 [2019-09-03 19:19:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:19:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:19:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:19:44,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:19:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:19:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:19:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:19:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:19:44,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-03 19:19:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:19:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:19:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:19:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:19:44,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:19:45,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:19:45,046 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-03 19:19:45,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:45 BoogieIcfgContainer [2019-09-03 19:19:45,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:19:45,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:19:45,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:19:45,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:19:45,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:19:44" (1/3) ... [2019-09-03 19:19:45,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abdbcc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:45, skipping insertion in model container [2019-09-03 19:19:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:19:44" (2/3) ... [2019-09-03 19:19:45,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abdbcc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:19:45, skipping insertion in model container [2019-09-03 19:19:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:19:45" (3/3) ... [2019-09-03 19:19:45,056 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2019-09-03 19:19:45,066 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:19:45,073 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:19:45,088 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:19:45,119 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:19:45,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:19:45,120 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:19:45,120 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:19:45,120 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:19:45,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:19:45,121 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:19:45,122 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:19:45,122 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:19:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-03 19:19:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:19:45,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,151 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash 288590464, now seen corresponding path program 1 times [2019-09-03 19:19:45,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:19:45,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:19:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:19:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:45,374 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-03 19:19:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,399 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-09-03 19:19:45,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:19:45,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-03 19:19:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,409 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:19:45,410 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:19:45,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:19:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:19:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-03 19:19:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-03 19:19:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-03 19:19:45,456 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 17 [2019-09-03 19:19:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,457 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-03 19:19:45,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:19:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-03 19:19:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:19:45,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,459 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1211863700, now seen corresponding path program 1 times [2019-09-03 19:19:45,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:19:45,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:19:45,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:45,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:45,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:45,597 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 4 states. [2019-09-03 19:19:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,722 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2019-09-03 19:19:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:45,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-03 19:19:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,726 INFO L225 Difference]: With dead ends: 58 [2019-09-03 19:19:45,726 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:19:45,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:19:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-09-03 19:19:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:19:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-09-03 19:19:45,739 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2019-09-03 19:19:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,739 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-09-03 19:19:45,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2019-09-03 19:19:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:19:45,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,741 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -250627941, now seen corresponding path program 1 times [2019-09-03 19:19:45,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:19:45,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:19:45,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:19:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:19:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:45,814 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 3 states. [2019-09-03 19:19:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:45,861 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-09-03 19:19:45,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:19:45,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-03 19:19:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:45,863 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:19:45,863 INFO L226 Difference]: Without dead ends: 34 [2019-09-03 19:19:45,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:19:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-03 19:19:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-03 19:19:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-03 19:19:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-09-03 19:19:45,872 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2019-09-03 19:19:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:45,872 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-09-03 19:19:45,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:19:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-09-03 19:19:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:19:45,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:45,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:45,874 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402608, now seen corresponding path program 1 times [2019-09-03 19:19:45,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:19:45,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:45,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:19:45,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:45,955 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2019-09-03 19:19:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,031 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2019-09-03 19:19:46,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:46,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-09-03 19:19:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,033 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:19:46,033 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 19:19:46,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 19:19:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-09-03 19:19:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:19:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-09-03 19:19:46,042 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 23 [2019-09-03 19:19:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,043 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-09-03 19:19:46,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-09-03 19:19:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:19:46,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,044 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2039819741, now seen corresponding path program 1 times [2019-09-03 19:19:46,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 19:19:46,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:19:46,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:19:46,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:19:46,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:19:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:46,133 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2019-09-03 19:19:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,197 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-03 19:19:46,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:46,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-09-03 19:19:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,199 INFO L225 Difference]: With dead ends: 57 [2019-09-03 19:19:46,199 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:19:46,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:19:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:19:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-09-03 19:19:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-03 19:19:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-09-03 19:19:46,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2019-09-03 19:19:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,220 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-09-03 19:19:46,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:19:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-09-03 19:19:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 19:19:46,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,222 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,222 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,223 INFO L82 PathProgramCache]: Analyzing trace with hash -118036183, now seen corresponding path program 1 times [2019-09-03 19:19:46,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:46,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:19:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:46,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:46,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:19:46,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:19:46,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:46,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-03 19:19:46,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:19:46,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:19:46,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:46,490 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2019-09-03 19:19:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:46,584 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-09-03 19:19:46,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:19:46,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-09-03 19:19:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:46,585 INFO L225 Difference]: With dead ends: 63 [2019-09-03 19:19:46,586 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:19:46,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:19:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:19:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-03 19:19:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:19:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-09-03 19:19:46,593 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 29 [2019-09-03 19:19:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:46,593 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-09-03 19:19:46,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:19:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-09-03 19:19:46,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 19:19:46,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:46,594 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:46,595 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:46,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1251798004, now seen corresponding path program 2 times [2019-09-03 19:19:46,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:46,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:46,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:46,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:19:46,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:46,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:46,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:19:46,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:46,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:46,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:19:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-03 19:19:46,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:19:46,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-03 19:19:46,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:19:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:19:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:46,852 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 8 states. [2019-09-03 19:19:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:47,053 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-09-03 19:19:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:47,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-09-03 19:19:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:47,055 INFO L225 Difference]: With dead ends: 93 [2019-09-03 19:19:47,056 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 19:19:47,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:19:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 19:19:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 43. [2019-09-03 19:19:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:19:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2019-09-03 19:19:47,072 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 32 [2019-09-03 19:19:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:47,072 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2019-09-03 19:19:47,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:19:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2019-09-03 19:19:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 19:19:47,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:47,077 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:47,077 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash -760243349, now seen corresponding path program 1 times [2019-09-03 19:19:47,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:47,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-03 19:19:47,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:47,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:47,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:19:47,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-03 19:19:47,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:19:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:19:47,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:47,292 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 8 states. [2019-09-03 19:19:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:47,369 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-09-03 19:19:47,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:19:47,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-09-03 19:19:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:47,370 INFO L225 Difference]: With dead ends: 78 [2019-09-03 19:19:47,370 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 19:19:47,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:19:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 19:19:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-03 19:19:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:19:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-09-03 19:19:47,386 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 38 [2019-09-03 19:19:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:47,388 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-09-03 19:19:47,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:19:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-09-03 19:19:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:19:47,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:47,389 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:47,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1857691010, now seen corresponding path program 2 times [2019-09-03 19:19:47,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:47,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:47,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 19:19:47,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:47,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:47,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:47,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:47,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:47,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:19:47,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:19:47,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-03 19:19:47,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:19:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:19:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:19:47,610 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 9 states. [2019-09-03 19:19:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:47,838 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-09-03 19:19:47,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:19:47,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-09-03 19:19:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:47,840 INFO L225 Difference]: With dead ends: 96 [2019-09-03 19:19:47,840 INFO L226 Difference]: Without dead ends: 80 [2019-09-03 19:19:47,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-03 19:19:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-03 19:19:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2019-09-03 19:19:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:19:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-03 19:19:47,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 41 [2019-09-03 19:19:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:47,850 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-03 19:19:47,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:19:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-03 19:19:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 19:19:47,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:47,853 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:47,853 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2016774676, now seen corresponding path program 3 times [2019-09-03 19:19:47,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:47,962 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-03 19:19:47,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:47,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:48,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:19:48,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:48,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:19:48,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-03 19:19:48,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:48,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-09-03 19:19:48,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:19:48,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:19:48,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:19:48,116 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 10 states. [2019-09-03 19:19:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:48,386 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2019-09-03 19:19:48,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:19:48,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-09-03 19:19:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:48,388 INFO L225 Difference]: With dead ends: 121 [2019-09-03 19:19:48,388 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:19:48,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:19:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:19:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2019-09-03 19:19:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:19:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-09-03 19:19:48,400 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 50 [2019-09-03 19:19:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:48,400 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-09-03 19:19:48,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:19:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-09-03 19:19:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:19:48,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:48,401 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:48,401 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:48,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -395002332, now seen corresponding path program 4 times [2019-09-03 19:19:48,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-03 19:19:48,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:48,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:48,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:48,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:19:48,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:48,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:48,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-03 19:19:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-03 19:19:48,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:19:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:19:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:19:48,678 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 12 states. [2019-09-03 19:19:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:48,921 INFO L93 Difference]: Finished difference Result 140 states and 172 transitions. [2019-09-03 19:19:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:19:48,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-09-03 19:19:48,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:48,922 INFO L225 Difference]: With dead ends: 140 [2019-09-03 19:19:48,922 INFO L226 Difference]: Without dead ends: 79 [2019-09-03 19:19:48,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:19:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-03 19:19:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2019-09-03 19:19:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:19:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-09-03 19:19:48,931 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 56 [2019-09-03 19:19:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:48,932 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-09-03 19:19:48,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:19:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-09-03 19:19:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-03 19:19:48,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:48,933 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:48,933 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1207541539, now seen corresponding path program 5 times [2019-09-03 19:19:48,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:19:49,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:49,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:49,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-03 19:19:52,025 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-03 19:19:52,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:52,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:19:52,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 61 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-03 19:19:52,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2019-09-03 19:19:52,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:19:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:19:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:19:52,130 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 11 states. [2019-09-03 19:19:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:52,204 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2019-09-03 19:19:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:19:52,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-09-03 19:19:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:52,205 INFO L225 Difference]: With dead ends: 133 [2019-09-03 19:19:52,206 INFO L226 Difference]: Without dead ends: 91 [2019-09-03 19:19:52,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:19:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-03 19:19:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-03 19:19:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:19:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2019-09-03 19:19:52,226 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 68 [2019-09-03 19:19:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:52,227 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2019-09-03 19:19:52,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:19:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2019-09-03 19:19:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-03 19:19:52,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:52,228 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:52,229 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1964052579, now seen corresponding path program 6 times [2019-09-03 19:19:52,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:52,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:52,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 133 proven. 66 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-03 19:19:52,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:52,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:52,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:19:52,574 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-03 19:19:52,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:52,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:19:52,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-03 19:19:52,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:52,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-03 19:19:52,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:19:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:19:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:19:52,686 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand 12 states. [2019-09-03 19:19:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:53,337 INFO L93 Difference]: Finished difference Result 221 states and 282 transitions. [2019-09-03 19:19:53,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-03 19:19:53,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-09-03 19:19:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:53,339 INFO L225 Difference]: With dead ends: 221 [2019-09-03 19:19:53,339 INFO L226 Difference]: Without dead ends: 167 [2019-09-03 19:19:53,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=430, Invalid=830, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:19:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-03 19:19:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2019-09-03 19:19:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:19:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 124 transitions. [2019-09-03 19:19:53,356 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 124 transitions. Word has length 86 [2019-09-03 19:19:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:53,356 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 124 transitions. [2019-09-03 19:19:53,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:19:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 124 transitions. [2019-09-03 19:19:53,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-03 19:19:53,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:53,364 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:53,364 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash -55858988, now seen corresponding path program 7 times [2019-09-03 19:19:53,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:53,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:53,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 194 proven. 105 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-03 19:19:53,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:53,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:53,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:19:53,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 175 proven. 35 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-03 19:19:53,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:53,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-03 19:19:53,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:19:53,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:19:53,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:19:53,908 INFO L87 Difference]: Start difference. First operand 103 states and 124 transitions. Second operand 15 states. [2019-09-03 19:19:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:53,988 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2019-09-03 19:19:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:19:53,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-09-03 19:19:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:53,989 INFO L225 Difference]: With dead ends: 181 [2019-09-03 19:19:53,990 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 19:19:53,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:19:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 19:19:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2019-09-03 19:19:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-03 19:19:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2019-09-03 19:19:53,999 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 98 [2019-09-03 19:19:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:54,000 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2019-09-03 19:19:54,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:19:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2019-09-03 19:19:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-03 19:19:54,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:54,001 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 5, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:54,001 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1611432910, now seen corresponding path program 8 times [2019-09-03 19:19:54,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:54,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:19:54,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2019-09-03 19:19:54,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:54,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:54,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:19:54,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:19:54,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:54,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:19:54,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 245 proven. 51 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:54,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:54,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-09-03 19:19:54,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:19:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:19:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:19:54,526 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 15 states. [2019-09-03 19:19:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:55,657 INFO L93 Difference]: Finished difference Result 302 states and 389 transitions. [2019-09-03 19:19:55,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-03 19:19:55,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-03 19:19:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:55,659 INFO L225 Difference]: With dead ends: 302 [2019-09-03 19:19:55,659 INFO L226 Difference]: Without dead ends: 233 [2019-09-03 19:19:55,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=931, Invalid=1931, Unknown=0, NotChecked=0, Total=2862 [2019-09-03 19:19:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-09-03 19:19:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 124. [2019-09-03 19:19:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-03 19:19:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2019-09-03 19:19:55,672 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 107 [2019-09-03 19:19:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:55,672 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2019-09-03 19:19:55,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:19:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2019-09-03 19:19:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-03 19:19:55,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:55,674 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:55,674 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:55,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1536612197, now seen corresponding path program 9 times [2019-09-03 19:19:55,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:55,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-03 19:19:55,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:55,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:55,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:56,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:19:56,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:56,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:19:56,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:56,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:56,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-03 19:19:56,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:19:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:19:56,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:19:56,168 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand 14 states. [2019-09-03 19:19:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:56,571 INFO L93 Difference]: Finished difference Result 283 states and 354 transitions. [2019-09-03 19:19:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:19:56,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2019-09-03 19:19:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:56,573 INFO L225 Difference]: With dead ends: 283 [2019-09-03 19:19:56,573 INFO L226 Difference]: Without dead ends: 255 [2019-09-03 19:19:56,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:19:56,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-03 19:19:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 175. [2019-09-03 19:19:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-03 19:19:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2019-09-03 19:19:56,590 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 119 [2019-09-03 19:19:56,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:56,590 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2019-09-03 19:19:56,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:19:56,591 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2019-09-03 19:19:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-03 19:19:56,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:56,593 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 35, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:56,593 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2094235774, now seen corresponding path program 10 times [2019-09-03 19:19:56,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:56,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:19:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 97 proven. 630 refuted. 0 times theorem prover too weak. 1354 trivial. 0 not checked. [2019-09-03 19:19:56,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:19:56,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:19:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:19:57,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:19:57,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:19:57,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-03 19:19:57,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:19:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2081 backedges. 56 proven. 630 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:19:57,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:19:57,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2019-09-03 19:19:57,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-03 19:19:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-03 19:19:57,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:19:57,428 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand 26 states. [2019-09-03 19:19:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:19:59,900 INFO L93 Difference]: Finished difference Result 460 states and 597 transitions. [2019-09-03 19:19:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-03 19:19:59,901 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 170 [2019-09-03 19:19:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:19:59,904 INFO L225 Difference]: With dead ends: 460 [2019-09-03 19:19:59,904 INFO L226 Difference]: Without dead ends: 331 [2019-09-03 19:19:59,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3317 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1963, Invalid=8749, Unknown=0, NotChecked=0, Total=10712 [2019-09-03 19:19:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-03 19:19:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 193. [2019-09-03 19:19:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-03 19:19:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2019-09-03 19:19:59,926 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 170 [2019-09-03 19:19:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:19:59,927 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2019-09-03 19:19:59,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-03 19:19:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2019-09-03 19:19:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-03 19:19:59,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:19:59,929 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 40, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:19:59,930 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:19:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:19:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1532723971, now seen corresponding path program 11 times [2019-09-03 19:19:59,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:19:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:19:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:19:59,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:19:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:20:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:20:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 925 proven. 644 refuted. 0 times theorem prover too weak. 1111 trivial. 0 not checked. [2019-09-03 19:20:00,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:20:00,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:20:00,605 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:17,591 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-09-03 19:26:17,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:18,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:26:18,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2680 backedges. 1475 proven. 92 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2019-09-03 19:26:18,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:18,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-09-03 19:26:18,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:26:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:26:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:26:18,185 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 21 states. [2019-09-03 19:26:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:26:18,325 INFO L93 Difference]: Finished difference Result 362 states and 463 transitions. [2019-09-03 19:26:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 19:26:18,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 188 [2019-09-03 19:26:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:26:18,328 INFO L225 Difference]: With dead ends: 362 [2019-09-03 19:26:18,328 INFO L226 Difference]: Without dead ends: 218 [2019-09-03 19:26:18,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:26:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-03 19:26:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2019-09-03 19:26:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-03 19:26:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2019-09-03 19:26:18,343 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 188 [2019-09-03 19:26:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:26:18,343 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2019-09-03 19:26:18,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:26:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2019-09-03 19:26:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-03 19:26:18,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:26:18,346 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 45, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:26:18,346 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:26:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:26:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1256991469, now seen corresponding path program 12 times [2019-09-03 19:26:18,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:26:18,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:26:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:18,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:26:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:26:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:26:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 1146 proven. 819 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2019-09-03 19:26:19,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:26:19,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:26:19,090 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:26:25,309 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-03 19:26:25,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:26:25,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-03 19:26:25,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:26:25,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16 [2019-09-03 19:26:25,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:25,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:65 [2019-09-03 19:26:25,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:25,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 82 [2019-09-03 19:26:25,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,542 INFO L567 ElimStorePlain]: treesize reduction 60, result has 55.9 percent of original size [2019-09-03 19:26:25,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-09-03 19:26:25,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,661 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,677 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:25,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 90 [2019-09-03 19:26:25,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,749 INFO L567 ElimStorePlain]: treesize reduction 60, result has 56.5 percent of original size [2019-09-03 19:26:25,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2019-09-03 19:26:25,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:25,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,831 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:25,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:25,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 158 [2019-09-03 19:26:25,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:25,969 INFO L567 ElimStorePlain]: treesize reduction 78, result has 55.4 percent of original size [2019-09-03 19:26:25,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:25,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-03 19:26:25,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:97 [2019-09-03 19:26:25,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:27,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:28,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:28,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,468 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:28,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:28,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:28,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 185 [2019-09-03 19:26:28,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:28,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:28,538 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:28,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:28,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:28,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 261 [2019-09-03 19:26:28,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:28,882 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-09-03 19:26:28,883 INFO L567 ElimStorePlain]: treesize reduction 256, result has 42.1 percent of original size [2019-09-03 19:26:28,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-03 19:26:28,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:198, output treesize:186 [2019-09-03 19:26:30,463 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-03 19:26:31,885 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-03 19:26:33,597 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-03 19:26:33,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:33,614 INFO L392 ElimStorePlain]: Different costs {56=[|v_#memory_int_17|], 72=[v_prenex_2]} [2019-09-03 19:26:33,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:33,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:33,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:33,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:33,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:33,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:33,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:33,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:34,018 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-09-03 19:26:34,019 INFO L341 Elim1Store]: treesize reduction 68, result has 73.9 percent of original size [2019-09-03 19:26:34,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 113 treesize of output 278 [2019-09-03 19:26:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:34,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:34,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:34,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:34,373 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 84 [2019-09-03 19:26:34,374 INFO L567 ElimStorePlain]: treesize reduction 274, result has 46.9 percent of original size [2019-09-03 19:26:34,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:34,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:34,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:34,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:34,407 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:34,571 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-09-03 19:26:34,572 INFO L341 Elim1Store]: treesize reduction 30, result has 85.9 percent of original size [2019-09-03 19:26:34,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 128 treesize of output 291 [2019-09-03 19:26:34,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:34,835 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-09-03 19:26:34,836 INFO L567 ElimStorePlain]: treesize reduction 141, result has 62.8 percent of original size [2019-09-03 19:26:34,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-03 19:26:34,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:242, output treesize:238 [2019-09-03 19:26:35,493 WARN L188 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-09-03 19:26:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:35,800 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-03 19:26:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,403 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-09-03 19:26:36,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,454 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,528 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,586 INFO L235 Elim1Store]: Index analysis took 162 ms [2019-09-03 19:26:36,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:36,900 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-09-03 19:26:36,901 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:36,902 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 8 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 38 case distinctions, treesize of input 160 treesize of output 572 [2019-09-03 19:26:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:36,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:36,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:36,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:37,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:37,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:37,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:37,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:26:37,176 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-09-03 19:26:37,177 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:37,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 10 disjoint index pairs (out of 55 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 154 treesize of output 436 [2019-09-03 19:26:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:37,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:37,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:37,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:37,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:37,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:38,899 WARN L188 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 348 DAG size of output: 120 [2019-09-03 19:26:38,900 INFO L567 ElimStorePlain]: treesize reduction 4894, result has 12.6 percent of original size [2019-09-03 19:26:38,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-09-03 19:26:38,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:315, output treesize:699 [2019-09-03 19:26:38,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:26:38,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:38,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,276 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-09-03 19:26:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 19:26:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:39,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,310 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 226 DAG size of output: 116 [2019-09-03 19:26:41,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-09-03 19:26:41,362 INFO L392 ElimStorePlain]: Different costs {67=[v_prenex_20, v_prenex_13], 77=[v_prenex_33, v_prenex_39], 99=[v_prenex_10, |#memory_int|, v_prenex_26]} [2019-09-03 19:26:41,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:41,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:41,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:41,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:41,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:41,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:41,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 9 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 167 [2019-09-03 19:26:41,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:41,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:42,265 WARN L188 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 322 [2019-09-03 19:26:42,266 INFO L567 ElimStorePlain]: treesize reduction 63, result has 93.0 percent of original size [2019-09-03 19:26:42,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:42,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:42,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:42,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:42,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:42,536 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2019-09-03 19:26:42,536 INFO L341 Elim1Store]: treesize reduction 48, result has 72.3 percent of original size [2019-09-03 19:26:42,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 8 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 27 case distinctions, treesize of input 115 treesize of output 179 [2019-09-03 19:26:42,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:42,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:44,134 WARN L188 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 351 DAG size of output: 307 [2019-09-03 19:26:44,135 INFO L567 ElimStorePlain]: treesize reduction 248, result has 75.8 percent of original size [2019-09-03 19:26:44,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:44,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:44,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:44,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:44,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:44,292 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-09-03 19:26:44,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:44,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 9 disjoint index pairs (out of 55 index pairs), introduced 13 new quantified variables, introduced 17 case distinctions, treesize of input 128 treesize of output 178 [2019-09-03 19:26:44,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:44,307 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:45,040 WARN L188 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 286 [2019-09-03 19:26:45,040 INFO L567 ElimStorePlain]: treesize reduction 69, result has 91.0 percent of original size [2019-09-03 19:26:45,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:45,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:45,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:45,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:45,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:45,303 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 86 [2019-09-03 19:26:45,303 INFO L341 Elim1Store]: treesize reduction 96, result has 60.8 percent of original size [2019-09-03 19:26:45,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 7 disjoint index pairs (out of 55 index pairs), introduced 13 new quantified variables, introduced 43 case distinctions, treesize of input 114 treesize of output 202 [2019-09-03 19:26:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:45,326 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:46,093 WARN L188 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 272 [2019-09-03 19:26:46,093 INFO L567 ElimStorePlain]: treesize reduction 182, result has 78.1 percent of original size [2019-09-03 19:26:46,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:46,401 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2019-09-03 19:26:46,402 INFO L341 Elim1Store]: treesize reduction 48, result has 78.9 percent of original size [2019-09-03 19:26:46,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 10 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 138 treesize of output 250 [2019-09-03 19:26:46,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:46,555 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:47,844 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 375 DAG size of output: 252 [2019-09-03 19:26:47,844 INFO L567 ElimStorePlain]: treesize reduction 1809, result has 24.0 percent of original size [2019-09-03 19:26:47,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:47,987 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-09-03 19:26:47,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:47,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 11 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 146 treesize of output 238 [2019-09-03 19:26:47,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:47,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,057 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:48,745 WARN L188 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 230 [2019-09-03 19:26:48,746 INFO L567 ElimStorePlain]: treesize reduction 964, result has 33.7 percent of original size [2019-09-03 19:26:48,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:26:48,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-03 19:26:48,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 11 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 238 [2019-09-03 19:26:48,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:48,978 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-03 19:26:49,648 WARN L188 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 207 [2019-09-03 19:26:49,649 INFO L567 ElimStorePlain]: treesize reduction 1017, result has 28.5 percent of original size [2019-09-03 19:26:49,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:26:49,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:26:49,654 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 45 variables, input treesize:907, output treesize:14 [2019-09-03 19:26:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 234 proven. 34 refuted. 0 times theorem prover too weak. 3067 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:26:49,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:26:49,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2019-09-03 19:26:49,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-03 19:26:49,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-03 19:26:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=699, Unknown=1, NotChecked=0, Total=812 [2019-09-03 19:26:49,887 INFO L87 Difference]: Start difference. First operand 208 states and 261 transitions. Second operand 29 states. [2019-09-03 19:26:51,273 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-09-03 19:27:06,260 WARN L188 SmtUtils]: Spent 14.91 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-03 19:27:07,410 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-09-03 19:27:08,759 WARN L188 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-03 19:27:09,130 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-09-03 19:27:11,674 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-03 19:27:12,139 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-09-03 19:27:12,621 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2019-09-03 19:27:13,133 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-03 19:27:13,590 WARN L188 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 148 [2019-09-03 19:27:14,411 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 126 [2019-09-03 19:27:15,072 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 79 [2019-09-03 19:27:15,886 WARN L188 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 131 [2019-09-03 19:27:16,508 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 84 [2019-09-03 19:27:17,158 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:17,741 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:18,320 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:18,904 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:19,508 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:20,101 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:20,702 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:21,325 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-09-03 19:27:22,993 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-09-03 19:27:24,198 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-09-03 19:27:26,100 WARN L188 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-03 19:27:26,577 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 144 [2019-09-03 19:27:27,514 WARN L188 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 121 [2019-09-03 19:27:28,139 WARN L188 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 88 [2019-09-03 19:27:29,110 WARN L188 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2019-09-03 19:27:29,744 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 93 [2019-09-03 19:27:31,371 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:33,686 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:35,018 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:36,439 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:38,158 WARN L188 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:39,401 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:40,718 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:42,103 WARN L188 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2019-09-03 19:27:44,850 WARN L188 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2019-09-03 19:27:45,393 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-03 19:27:45,957 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-09-03 19:27:46,625 WARN L188 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 87 [2019-09-03 19:27:47,275 WARN L188 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 92 [2019-09-03 19:27:47,822 WARN L188 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:48,362 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:48,905 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:49,456 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:49,997 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:50,551 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:51,121 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:51,688 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-09-03 19:27:52,294 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-09-03 19:27:52,874 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-09-03 19:27:53,413 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 79 [2019-09-03 19:27:53,960 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-03 19:27:54,584 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 80 [2019-09-03 19:27:55,241 WARN L188 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 85 [2019-09-03 19:27:55,767 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:56,312 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:56,889 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:57,493 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:58,099 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:58,841 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:27:59,489 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:28:00,169 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-09-03 19:28:00,483 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2019-09-03 19:28:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:01,500 INFO L93 Difference]: Finished difference Result 642 states and 834 transitions. [2019-09-03 19:28:01,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-03 19:28:01,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 203 [2019-09-03 19:28:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:01,506 INFO L225 Difference]: With dead ends: 642 [2019-09-03 19:28:01,506 INFO L226 Difference]: Without dead ends: 463 [2019-09-03 19:28:01,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4432 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=2365, Invalid=10744, Unknown=1, NotChecked=0, Total=13110 [2019-09-03 19:28:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-03 19:28:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 398. [2019-09-03 19:28:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-03 19:28:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 505 transitions. [2019-09-03 19:28:01,555 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 505 transitions. Word has length 203 [2019-09-03 19:28:01,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:01,555 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 505 transitions. [2019-09-03 19:28:01,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-03 19:28:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 505 transitions. [2019-09-03 19:28:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-03 19:28:01,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:01,558 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 7, 7, 7, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:01,559 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:01,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash -13411013, now seen corresponding path program 1 times [2019-09-03 19:28:01,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:01,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4065 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3995 trivial. 0 not checked. [2019-09-03 19:28:03,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:03,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:03,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:03,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:28:03,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4065 backedges. 1289 proven. 145 refuted. 0 times theorem prover too weak. 2631 trivial. 0 not checked. [2019-09-03 19:28:03,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 22 [2019-09-03 19:28:03,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-03 19:28:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-03 19:28:03,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2019-09-03 19:28:03,553 INFO L87 Difference]: Start difference. First operand 398 states and 505 transitions. Second operand 22 states. [2019-09-03 19:28:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:06,530 INFO L93 Difference]: Finished difference Result 1130 states and 1480 transitions. [2019-09-03 19:28:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-09-03 19:28:06,530 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 218 [2019-09-03 19:28:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:06,536 INFO L225 Difference]: With dead ends: 1130 [2019-09-03 19:28:06,536 INFO L226 Difference]: Without dead ends: 816 [2019-09-03 19:28:06,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4401 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4074, Invalid=9498, Unknown=0, NotChecked=0, Total=13572 [2019-09-03 19:28:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-09-03 19:28:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 431. [2019-09-03 19:28:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-03 19:28:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 548 transitions. [2019-09-03 19:28:06,589 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 548 transitions. Word has length 218 [2019-09-03 19:28:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:06,590 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 548 transitions. [2019-09-03 19:28:06,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-03 19:28:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 548 transitions. [2019-09-03 19:28:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-03 19:28:06,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:06,593 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 8, 8, 8, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:06,593 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash -346827936, now seen corresponding path program 2 times [2019-09-03 19:28:06,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:06,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:06,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:28:06,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 1660 proven. 1232 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2019-09-03 19:28:07,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:07,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:07,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:28:07,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:28:07,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:07,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:28:07,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 1549 proven. 176 refuted. 0 times theorem prover too weak. 3167 trivial. 0 not checked. [2019-09-03 19:28:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-09-03 19:28:07,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-03 19:28:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-03 19:28:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:28:07,777 INFO L87 Difference]: Start difference. First operand 431 states and 548 transitions. Second operand 27 states. [2019-09-03 19:28:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:07,964 INFO L93 Difference]: Finished difference Result 822 states and 1064 transitions. [2019-09-03 19:28:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 19:28:07,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 236 [2019-09-03 19:28:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:07,968 INFO L225 Difference]: With dead ends: 822 [2019-09-03 19:28:07,968 INFO L226 Difference]: Without dead ends: 481 [2019-09-03 19:28:07,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=285, Invalid=417, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:28:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-03 19:28:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 461. [2019-09-03 19:28:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-09-03 19:28:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 588 transitions. [2019-09-03 19:28:08,027 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 588 transitions. Word has length 236 [2019-09-03 19:28:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:08,027 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 588 transitions. [2019-09-03 19:28:08,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-03 19:28:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 588 transitions. [2019-09-03 19:28:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-03 19:28:08,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:08,031 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 8, 8, 8, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:08,031 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash -984782828, now seen corresponding path program 3 times [2019-09-03 19:28:08,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:08,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:08,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:08,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5772 backedges. 1833 proven. 210 refuted. 0 times theorem prover too weak. 3729 trivial. 0 not checked. [2019-09-03 19:28:09,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:09,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 19:28:09,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-03 19:28:09,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:09,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:28:09,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5772 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 5680 trivial. 0 not checked. [2019-09-03 19:28:09,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:09,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2019-09-03 19:28:09,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 19:28:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 19:28:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2019-09-03 19:28:09,910 INFO L87 Difference]: Start difference. First operand 461 states and 588 transitions. Second operand 25 states. [2019-09-03 19:28:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:14,653 INFO L93 Difference]: Finished difference Result 1392 states and 1829 transitions. [2019-09-03 19:28:14,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-09-03 19:28:14,657 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 251 [2019-09-03 19:28:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:14,662 INFO L225 Difference]: With dead ends: 1392 [2019-09-03 19:28:14,663 INFO L226 Difference]: Without dead ends: 1027 [2019-09-03 19:28:14,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8484 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6906, Invalid=16656, Unknown=0, NotChecked=0, Total=23562 [2019-09-03 19:28:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-09-03 19:28:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 494. [2019-09-03 19:28:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-03 19:28:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 631 transitions. [2019-09-03 19:28:14,728 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 631 transitions. Word has length 251 [2019-09-03 19:28:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:14,729 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 631 transitions. [2019-09-03 19:28:14,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 19:28:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 631 transitions. [2019-09-03 19:28:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-03 19:28:14,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:14,732 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 9, 9, 9, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:14,733 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1805036849, now seen corresponding path program 4 times [2019-09-03 19:28:14,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:14,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:14,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6752 backedges. 2270 proven. 1729 refuted. 0 times theorem prover too weak. 2753 trivial. 0 not checked. [2019-09-03 19:28:15,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:15,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:28:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:15,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:28:15,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:28:15,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:28:15,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:28:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6752 backedges. 215 proven. 2130 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2019-09-03 19:28:16,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:28:16,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 41 [2019-09-03 19:28:16,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 19:28:16,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 19:28:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1333, Unknown=0, NotChecked=0, Total=1640 [2019-09-03 19:28:16,357 INFO L87 Difference]: Start difference. First operand 494 states and 631 transitions. Second operand 41 states. [2019-09-03 19:28:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:28:22,346 INFO L93 Difference]: Finished difference Result 1588 states and 2090 transitions. [2019-09-03 19:28:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-09-03 19:28:22,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 269 [2019-09-03 19:28:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:28:22,352 INFO L225 Difference]: With dead ends: 1588 [2019-09-03 19:28:22,352 INFO L226 Difference]: Without dead ends: 1196 [2019-09-03 19:28:22,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16298 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6193, Invalid=39817, Unknown=0, NotChecked=0, Total=46010 [2019-09-03 19:28:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-09-03 19:28:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 527. [2019-09-03 19:28:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-03 19:28:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 674 transitions. [2019-09-03 19:28:22,427 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 674 transitions. Word has length 269 [2019-09-03 19:28:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:28:22,427 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 674 transitions. [2019-09-03 19:28:22,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-03 19:28:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 674 transitions. [2019-09-03 19:28:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-03 19:28:22,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:28:22,431 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 10, 10, 10, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:28:22,432 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:28:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:28:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 315672116, now seen corresponding path program 5 times [2019-09-03 19:28:22,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:28:22,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:28:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:22,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:28:22,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:28:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:28:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7810 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 7665 trivial. 0 not checked. [2019-09-03 19:28:23,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:28:23,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:28:23,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1