/usr/bin/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/eca-rers2012/Problem10_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:06:44,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:06:44,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:06:44,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:06:44,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:06:44,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:06:44,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:06:44,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:06:44,146 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:06:44,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:06:44,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:06:44,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:06:44,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:06:44,150 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:06:44,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:06:44,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:06:44,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:06:44,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:06:44,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:06:44,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:06:44,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:06:44,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:06:44,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:06:44,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:06:44,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:06:44,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:06:44,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:06:44,171 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:06:44,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:06:44,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:06:44,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:06:44,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:06:44,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:06:44,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:06:44,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:06:44,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:06:44,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:06:44,182 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:06:44,182 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:06:44,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:06:44,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:06:44,185 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-11-06 19:06:44,208 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:06:44,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:06:44,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:06:44,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:06:44,210 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:06:44,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:06:44,210 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:06:44,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:06:44,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:06:44,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:06:44,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:06:44,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:06:44,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:06:44,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:06:44,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:06:44,212 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:06:44,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:06:44,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:06:44,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:06:44,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:06:44,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:06:44,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:06:44,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:06:44,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:06:44,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:06:44,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:06:44,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:06:44,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:06:44,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:06:44,489 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:06:44,505 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:06:44,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:06:44,510 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:06:44,510 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:06:44,511 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-11-06 19:06:44,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92dc363f/2472d2287f244357817fe29eb0966845/FLAG8a2810003 [2019-11-06 19:06:45,107 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:06:45,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label50.c [2019-11-06 19:06:45,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92dc363f/2472d2287f244357817fe29eb0966845/FLAG8a2810003 [2019-11-06 19:06:45,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92dc363f/2472d2287f244357817fe29eb0966845 [2019-11-06 19:06:45,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:06:45,412 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:06:45,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:06:45,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:06:45,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:06:45,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:06:45" (1/1) ... [2019-11-06 19:06:45,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d9e582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:45, skipping insertion in model container [2019-11-06 19:06:45,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:06:45" (1/1) ... [2019-11-06 19:06:45,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:06:45,484 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:06:46,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:06:46,013 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:06:46,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:06:46,153 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:06:46,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46 WrapperNode [2019-11-06 19:06:46,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:06:46,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:06:46,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:06:46,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:06:46,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (1/1) ... [2019-11-06 19:06:46,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:06:46,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:06:46,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:06:46,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:06:46,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (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-11-06 19:06:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:06:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:06:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 19:06:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:06:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 19:06:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:06:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:06:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:06:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:06:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:06:46,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:06:47,534 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:06:47,534 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 19:06:47,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:06:47 BoogieIcfgContainer [2019-11-06 19:06:47,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:06:47,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:06:47,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:06:47,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:06:47,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:06:45" (1/3) ... [2019-11-06 19:06:47,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4bc6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:06:47, skipping insertion in model container [2019-11-06 19:06:47,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:06:46" (2/3) ... [2019-11-06 19:06:47,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4bc6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:06:47, skipping insertion in model container [2019-11-06 19:06:47,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:06:47" (3/3) ... [2019-11-06 19:06:47,555 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label50.c [2019-11-06 19:06:47,566 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:06:47,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:06:47,587 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:06:47,624 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:06:47,624 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:06:47,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:06:47,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:06:47,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:06:47,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:06:47,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:06:47,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:06:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2019-11-06 19:06:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 19:06:47,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:47,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:06:47,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash 397772918, now seen corresponding path program 1 times [2019-11-06 19:06:47,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:47,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818813136] [2019-11-06 19:06:47,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:47,969 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818813136] [2019-11-06 19:06:47,970 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:06:47,970 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:06:47,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529039173] [2019-11-06 19:06:47,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:06:47,978 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:06:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:06:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:06:47,996 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2019-11-06 19:06:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:06:49,902 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2019-11-06 19:06:49,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:06:49,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-06 19:06:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:06:49,922 INFO L225 Difference]: With dead ends: 730 [2019-11-06 19:06:49,922 INFO L226 Difference]: Without dead ends: 447 [2019-11-06 19:06:49,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:06:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-06 19:06:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2019-11-06 19:06:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-11-06 19:06:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2019-11-06 19:06:50,020 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 15 [2019-11-06 19:06:50,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:06:50,021 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2019-11-06 19:06:50,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:06:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2019-11-06 19:06:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-06 19:06:50,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:50,026 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:06:50,026 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:50,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1068134291, now seen corresponding path program 1 times [2019-11-06 19:06:50,027 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:50,027 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416004038] [2019-11-06 19:06:50,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:50,334 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416004038] [2019-11-06 19:06:50,334 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:06:50,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:06:50,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099214686] [2019-11-06 19:06:50,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:06:50,337 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:06:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:06:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:06:50,339 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 9 states. [2019-11-06 19:06:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:06:51,847 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2019-11-06 19:06:51,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:06:51,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-11-06 19:06:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:06:51,853 INFO L225 Difference]: With dead ends: 1041 [2019-11-06 19:06:51,854 INFO L226 Difference]: Without dead ends: 606 [2019-11-06 19:06:51,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-11-06 19:06:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-06 19:06:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2019-11-06 19:06:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-06 19:06:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2019-11-06 19:06:51,940 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 88 [2019-11-06 19:06:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:06:51,941 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2019-11-06 19:06:51,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:06:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2019-11-06 19:06:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-06 19:06:51,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:51,945 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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-11-06 19:06:51,946 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1363459929, now seen corresponding path program 1 times [2019-11-06 19:06:51,947 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:51,947 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874413214] [2019-11-06 19:06:51,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:52,144 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874413214] [2019-11-06 19:06:52,145 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816785790] [2019-11-06 19:06:52,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:06:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:52,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 19:06:52,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:06:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:52,327 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:06:52,327 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-06 19:06:52,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178229761] [2019-11-06 19:06:52,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:06:52,334 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:06:52,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:06:52,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:06:52,335 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 3 states. [2019-11-06 19:06:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:06:52,884 INFO L93 Difference]: Finished difference Result 1615 states and 2274 transitions. [2019-11-06 19:06:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:06:52,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-06 19:06:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:06:52,891 INFO L225 Difference]: With dead ends: 1615 [2019-11-06 19:06:52,892 INFO L226 Difference]: Without dead ends: 1029 [2019-11-06 19:06:52,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:06:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-11-06 19:06:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 886. [2019-11-06 19:06:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-11-06 19:06:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1150 transitions. [2019-11-06 19:06:52,928 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1150 transitions. Word has length 94 [2019-11-06 19:06:52,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:06:52,929 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1150 transitions. [2019-11-06 19:06:52,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:06:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1150 transitions. [2019-11-06 19:06:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-06 19:06:52,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:52,936 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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-11-06 19:06:53,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:06:53,142 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash -396385674, now seen corresponding path program 1 times [2019-11-06 19:06:53,143 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:53,143 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91469670] [2019-11-06 19:06:53,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:53,574 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91469670] [2019-11-06 19:06:53,574 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:06:53,574 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 19:06:53,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998919710] [2019-11-06 19:06:53,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:06:53,576 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:06:53,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:06:53,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:06:53,576 INFO L87 Difference]: Start difference. First operand 886 states and 1150 transitions. Second operand 9 states. [2019-11-06 19:06:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:06:55,289 INFO L93 Difference]: Finished difference Result 2245 states and 2959 transitions. [2019-11-06 19:06:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:06:55,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2019-11-06 19:06:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:06:55,299 INFO L225 Difference]: With dead ends: 2245 [2019-11-06 19:06:55,300 INFO L226 Difference]: Without dead ends: 1365 [2019-11-06 19:06:55,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-06 19:06:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2019-11-06 19:06:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1057. [2019-11-06 19:06:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2019-11-06 19:06:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1317 transitions. [2019-11-06 19:06:55,349 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1317 transitions. Word has length 151 [2019-11-06 19:06:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:06:55,350 INFO L462 AbstractCegarLoop]: Abstraction has 1057 states and 1317 transitions. [2019-11-06 19:06:55,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:06:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1317 transitions. [2019-11-06 19:06:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-06 19:06:55,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:55,353 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:06:55,353 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:55,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1385846678, now seen corresponding path program 1 times [2019-11-06 19:06:55,357 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:55,357 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702709793] [2019-11-06 19:06:55,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 83 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:06:55,720 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702709793] [2019-11-06 19:06:55,721 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711719371] [2019-11-06 19:06:55,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:06:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:55,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 19:06:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:06:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 84 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:06:55,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:06:55,970 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-06 19:06:55,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372855222] [2019-11-06 19:06:55,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:06:55,973 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:06:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:06:55,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:06:55,974 INFO L87 Difference]: Start difference. First operand 1057 states and 1317 transitions. Second operand 11 states. [2019-11-06 19:06:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:06:59,540 INFO L93 Difference]: Finished difference Result 2933 states and 4043 transitions. [2019-11-06 19:06:59,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 19:06:59,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-11-06 19:06:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:06:59,558 INFO L225 Difference]: With dead ends: 2933 [2019-11-06 19:06:59,558 INFO L226 Difference]: Without dead ends: 1882 [2019-11-06 19:06:59,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2019-11-06 19:06:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-11-06 19:06:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1548. [2019-11-06 19:06:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-11-06 19:06:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1966 transitions. [2019-11-06 19:06:59,627 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1966 transitions. Word has length 175 [2019-11-06 19:06:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:06:59,628 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 1966 transitions. [2019-11-06 19:06:59,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:06:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1966 transitions. [2019-11-06 19:06:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-06 19:06:59,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:06:59,631 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:06:59,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:06:59,845 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:06:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:06:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2064509357, now seen corresponding path program 1 times [2019-11-06 19:06:59,845 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:06:59,846 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050902389] [2019-11-06 19:06:59,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:06:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:06:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-06 19:07:00,030 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050902389] [2019-11-06 19:07:00,031 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649604721] [2019-11-06 19:07:00,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:00,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 19:07:00,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-06 19:07:00,153 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:07:00,153 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-06 19:07:00,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016693692] [2019-11-06 19:07:00,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:07:00,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:00,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:07:00,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:07:00,155 INFO L87 Difference]: Start difference. First operand 1548 states and 1966 transitions. Second operand 3 states. [2019-11-06 19:07:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:00,808 INFO L93 Difference]: Finished difference Result 3237 states and 4164 transitions. [2019-11-06 19:07:00,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:07:00,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-06 19:07:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:00,818 INFO L225 Difference]: With dead ends: 3237 [2019-11-06 19:07:00,818 INFO L226 Difference]: Without dead ends: 1695 [2019-11-06 19:07:00,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:07:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2019-11-06 19:07:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1544. [2019-11-06 19:07:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-06 19:07:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1916 transitions. [2019-11-06 19:07:00,883 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1916 transitions. Word has length 192 [2019-11-06 19:07:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:00,884 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1916 transitions. [2019-11-06 19:07:00,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:07:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1916 transitions. [2019-11-06 19:07:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-06 19:07:00,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:00,890 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:07:01,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:01,103 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 539367001, now seen corresponding path program 1 times [2019-11-06 19:07:01,104 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:01,104 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993814638] [2019-11-06 19:07:01,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:07:01,537 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993814638] [2019-11-06 19:07:01,537 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936518084] [2019-11-06 19:07:01,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:01,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 19:07:01,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:07:01,806 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:07:01,806 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2019-11-06 19:07:01,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880958371] [2019-11-06 19:07:01,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-06 19:07:01,808 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:01,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 19:07:01,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:07:01,809 INFO L87 Difference]: Start difference. First operand 1544 states and 1916 transitions. Second operand 13 states. [2019-11-06 19:07:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:05,376 INFO L93 Difference]: Finished difference Result 4866 states and 6072 transitions. [2019-11-06 19:07:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 19:07:05,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-11-06 19:07:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:05,386 INFO L225 Difference]: With dead ends: 4866 [2019-11-06 19:07:05,387 INFO L226 Difference]: Without dead ends: 1977 [2019-11-06 19:07:05,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2019-11-06 19:07:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2019-11-06 19:07:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1524. [2019-11-06 19:07:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1524 states. [2019-11-06 19:07:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1757 transitions. [2019-11-06 19:07:05,445 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1757 transitions. Word has length 230 [2019-11-06 19:07:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:05,445 INFO L462 AbstractCegarLoop]: Abstraction has 1524 states and 1757 transitions. [2019-11-06 19:07:05,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-06 19:07:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1757 transitions. [2019-11-06 19:07:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-06 19:07:05,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:05,451 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-11-06 19:07:05,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:05,654 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:05,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1113807393, now seen corresponding path program 1 times [2019-11-06 19:07:05,655 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:05,656 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515827378] [2019-11-06 19:07:05,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:07:05,975 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515827378] [2019-11-06 19:07:05,976 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964148479] [2019-11-06 19:07:05,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:06,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 19:07:06,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:07:06,129 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:07:06,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-06 19:07:06,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759187152] [2019-11-06 19:07:06,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:07:06,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:06,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:07:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:07:06,131 INFO L87 Difference]: Start difference. First operand 1524 states and 1757 transitions. Second operand 11 states. [2019-11-06 19:07:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:07,951 INFO L93 Difference]: Finished difference Result 2738 states and 3125 transitions. [2019-11-06 19:07:07,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:07:07,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 234 [2019-11-06 19:07:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:07,957 INFO L225 Difference]: With dead ends: 2738 [2019-11-06 19:07:07,958 INFO L226 Difference]: Without dead ends: 1363 [2019-11-06 19:07:07,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:07:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-11-06 19:07:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1198. [2019-11-06 19:07:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-11-06 19:07:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1300 transitions. [2019-11-06 19:07:07,990 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1300 transitions. Word has length 234 [2019-11-06 19:07:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:07,991 INFO L462 AbstractCegarLoop]: Abstraction has 1198 states and 1300 transitions. [2019-11-06 19:07:07,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:07:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1300 transitions. [2019-11-06 19:07:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-06 19:07:07,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:07,995 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:07:08,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:08,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1472473771, now seen corresponding path program 1 times [2019-11-06 19:07:08,201 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:08,202 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305248738] [2019-11-06 19:07:08,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:07:08,584 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305248738] [2019-11-06 19:07:08,585 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668426895] [2019-11-06 19:07:08,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:08,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 19:07:08,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 19:07:08,835 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:07:08,835 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-06 19:07:08,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91848184] [2019-11-06 19:07:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:07:08,836 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:07:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:07:08,837 INFO L87 Difference]: Start difference. First operand 1198 states and 1300 transitions. Second operand 5 states. [2019-11-06 19:07:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:09,614 INFO L93 Difference]: Finished difference Result 2561 states and 2778 transitions. [2019-11-06 19:07:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:07:09,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-11-06 19:07:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:09,623 INFO L225 Difference]: With dead ends: 2561 [2019-11-06 19:07:09,623 INFO L226 Difference]: Without dead ends: 1369 [2019-11-06 19:07:09,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:07:09,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-11-06 19:07:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1345. [2019-11-06 19:07:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-06 19:07:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1454 transitions. [2019-11-06 19:07:09,656 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1454 transitions. Word has length 244 [2019-11-06 19:07:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:09,656 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1454 transitions. [2019-11-06 19:07:09,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:07:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1454 transitions. [2019-11-06 19:07:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-11-06 19:07:09,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:09,661 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:07:09,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:09,866 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:09,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:09,867 INFO L82 PathProgramCache]: Analyzing trace with hash -744935455, now seen corresponding path program 1 times [2019-11-06 19:07:09,867 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:09,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675736406] [2019-11-06 19:07:09,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-06 19:07:10,208 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675736406] [2019-11-06 19:07:10,208 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398671291] [2019-11-06 19:07:10,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:10,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 19:07:10,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:10,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-06 19:07:10,411 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:07:10,411 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-06 19:07:10,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274980769] [2019-11-06 19:07:10,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 19:07:10,412 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 19:07:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:07:10,413 INFO L87 Difference]: Start difference. First operand 1345 states and 1454 transitions. Second operand 3 states. [2019-11-06 19:07:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:10,958 INFO L93 Difference]: Finished difference Result 3115 states and 3396 transitions. [2019-11-06 19:07:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 19:07:10,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-11-06 19:07:10,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:10,968 INFO L225 Difference]: With dead ends: 3115 [2019-11-06 19:07:10,968 INFO L226 Difference]: Without dead ends: 1774 [2019-11-06 19:07:10,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:07:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2019-11-06 19:07:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1486. [2019-11-06 19:07:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2019-11-06 19:07:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1600 transitions. [2019-11-06 19:07:11,001 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1600 transitions. Word has length 266 [2019-11-06 19:07:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:11,001 INFO L462 AbstractCegarLoop]: Abstraction has 1486 states and 1600 transitions. [2019-11-06 19:07:11,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 19:07:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1600 transitions. [2019-11-06 19:07:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-06 19:07:11,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:11,007 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-11-06 19:07:11,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:11,216 INFO L410 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1813224930, now seen corresponding path program 1 times [2019-11-06 19:07:11,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:11,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026210681] [2019-11-06 19:07:11,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-06 19:07:11,413 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026210681] [2019-11-06 19:07:11,414 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101046484] [2019-11-06 19:07:11,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:11,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-06 19:07:11,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:11,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:07:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 170 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-06 19:07:11,658 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:07:11,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-06 19:07:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416267862] [2019-11-06 19:07:11,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:07:11,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:07:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:07:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:07:11,660 INFO L87 Difference]: Start difference. First operand 1486 states and 1600 transitions. Second operand 9 states. [2019-11-06 19:07:14,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:07:14,424 INFO L93 Difference]: Finished difference Result 4619 states and 5207 transitions. [2019-11-06 19:07:14,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-06 19:07:14,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 275 [2019-11-06 19:07:14,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:07:14,437 INFO L225 Difference]: With dead ends: 4619 [2019-11-06 19:07:14,437 INFO L226 Difference]: Without dead ends: 3135 [2019-11-06 19:07:14,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-11-06 19:07:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-11-06 19:07:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2944. [2019-11-06 19:07:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-11-06 19:07:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 3193 transitions. [2019-11-06 19:07:14,515 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 3193 transitions. Word has length 275 [2019-11-06 19:07:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:07:14,516 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 3193 transitions. [2019-11-06 19:07:14,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:07:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3193 transitions. [2019-11-06 19:07:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-06 19:07:14,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:07:14,528 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 19:07:14,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:14,739 INFO L410 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:07:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:07:14,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1033916999, now seen corresponding path program 1 times [2019-11-06 19:07:14,740 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:07:14,740 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804612719] [2019-11-06 19:07:14,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:07:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 245 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-06 19:07:15,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804612719] [2019-11-06 19:07:15,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683713053] [2019-11-06 19:07:15,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:07:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:07:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-06 19:07:15,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:07:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:07:15,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms