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/reducercommutativity/max05-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:42:26,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:42:26,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:42:26,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:42:26,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:42:26,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:42:26,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:42:26,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:42:26,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:42:26,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:42:26,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:42:26,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:42:26,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:42:26,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:42:26,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:42:26,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:42:26,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:42:26,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:42:26,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:42:26,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:42:26,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:42:26,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:42:26,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:42:26,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:42:26,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:42:26,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:42:26,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:42:26,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:42:26,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:42:26,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:42:26,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:42:26,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:42:26,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:42:26,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:42:26,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:42:26,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:42:26,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:42:26,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:42:26,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:42:26,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:42:26,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:42:26,246 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-10-14 23:42:26,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:42:26,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:42:26,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:42:26,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:42:26,273 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:42:26,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:42:26,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:42:26,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:42:26,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:42:26,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:42:26,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:42:26,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:42:26,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:42:26,276 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:42:26,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:42:26,276 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:42:26,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:42:26,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:42:26,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:42:26,277 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:42:26,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:42:26,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:42:26,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:42:26,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:42:26,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:42:26,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:42:26,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:42:26,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:42:26,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:42:26,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:42:26,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:42:26,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:42:26,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:42:26,559 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:42:26,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-14 23:42:26,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7bfe4e0/486a58df190f4278a23aa43a4ded5271/FLAG506dce3f5 [2019-10-14 23:42:27,052 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:42:27,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max05-1.i [2019-10-14 23:42:27,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7bfe4e0/486a58df190f4278a23aa43a4ded5271/FLAG506dce3f5 [2019-10-14 23:42:27,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7bfe4e0/486a58df190f4278a23aa43a4ded5271 [2019-10-14 23:42:27,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:42:27,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:42:27,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:42:27,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:42:27,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:42:27,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27, skipping insertion in model container [2019-10-14 23:42:27,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,476 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:42:27,492 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:42:27,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:42:27,668 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:42:27,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:42:27,789 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:42:27,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27 WrapperNode [2019-10-14 23:42:27,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:42:27,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:42:27,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:42:27,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:42:27,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (1/1) ... [2019-10-14 23:42:27,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:42:27,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:42:27,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:42:27,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:42:27,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (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-10-14 23:42:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:42:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:42:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-14 23:42:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:42:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:42:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:42:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-14 23:42:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:42:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:42:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:42:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:42:27,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:42:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:42:27,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:42:28,162 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:42:28,162 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:42:28,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:28 BoogieIcfgContainer [2019-10-14 23:42:28,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:42:28,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:42:28,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:42:28,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:42:28,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:42:27" (1/3) ... [2019-10-14 23:42:28,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3768b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:28, skipping insertion in model container [2019-10-14 23:42:28,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:42:27" (2/3) ... [2019-10-14 23:42:28,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3768b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:42:28, skipping insertion in model container [2019-10-14 23:42:28,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:42:28" (3/3) ... [2019-10-14 23:42:28,174 INFO L109 eAbstractionObserver]: Analyzing ICFG max05-1.i [2019-10-14 23:42:28,189 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:42:28,202 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:42:28,214 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:42:28,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:42:28,240 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:42:28,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:42:28,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:42:28,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:42:28,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:42:28,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:42:28,241 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:42:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-14 23:42:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:42:28,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:28,265 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:28,267 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1379671032, now seen corresponding path program 1 times [2019-10-14 23:42:28,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:28,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680401309] [2019-10-14 23:42:28,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:28,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-14 23:42:28,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680401309] [2019-10-14 23:42:28,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:28,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:28,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931543107] [2019-10-14 23:42:28,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:28,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:28,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:28,570 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2019-10-14 23:42:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:28,751 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2019-10-14 23:42:28,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:28,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-14 23:42:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:28,765 INFO L225 Difference]: With dead ends: 60 [2019-10-14 23:42:28,766 INFO L226 Difference]: Without dead ends: 30 [2019-10-14 23:42:28,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-14 23:42:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-14 23:42:28,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 23:42:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-14 23:42:28,839 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 32 [2019-10-14 23:42:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:28,840 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-14 23:42:28,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-14 23:42:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:42:28,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:28,846 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:28,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 551744077, now seen corresponding path program 1 times [2019-10-14 23:42:28,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:28,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404576310] [2019-10-14 23:42:28,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:28,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:42:29,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404576310] [2019-10-14 23:42:29,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696262685] [2019-10-14 23:42:29,025 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-10-14 23:42:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:42:29,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:42:29,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:42:29,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-10-14 23:42:29,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350518079] [2019-10-14 23:42:29,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:42:29,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:42:29,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:29,150 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-10-14 23:42:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:29,181 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2019-10-14 23:42:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:42:29,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:42:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:29,186 INFO L225 Difference]: With dead ends: 52 [2019-10-14 23:42:29,187 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:42:29,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:42:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-14 23:42:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 23:42:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-14 23:42:29,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 34 [2019-10-14 23:42:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:29,199 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-14 23:42:29,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:42:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-14 23:42:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:42:29,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:29,202 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:29,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:29,406 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 727331048, now seen corresponding path program 1 times [2019-10-14 23:42:29,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:29,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263271493] [2019-10-14 23:42:29,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:29,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:29,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:29,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263271493] [2019-10-14 23:42:29,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:42:29,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:42:29,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707250286] [2019-10-14 23:42:29,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:42:29,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:42:29,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:29,584 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-10-14 23:42:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:29,706 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-14 23:42:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:42:29,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:42:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:29,707 INFO L225 Difference]: With dead ends: 47 [2019-10-14 23:42:29,707 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 23:42:29,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:42:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 23:42:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-14 23:42:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-14 23:42:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-14 23:42:29,715 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 46 [2019-10-14 23:42:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:29,717 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-14 23:42:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:42:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-14 23:42:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:42:29,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:29,719 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:29,720 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -270429754, now seen corresponding path program 1 times [2019-10-14 23:42:29,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:29,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033272203] [2019-10-14 23:42:29,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:29,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:29,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:29,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033272203] [2019-10-14 23:42:29,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613803917] [2019-10-14 23:42:29,834 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-10-14 23:42:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:29,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:42:29,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:29,941 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:29,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-14 23:42:29,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784322521] [2019-10-14 23:42:29,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:42:29,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:42:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:42:29,943 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 6 states. [2019-10-14 23:42:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:30,048 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-14 23:42:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:42:30,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-10-14 23:42:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:30,050 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:42:30,050 INFO L226 Difference]: Without dead ends: 34 [2019-10-14 23:42:30,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:42:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-14 23:42:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-14 23:42:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:42:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-14 23:42:30,057 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 48 [2019-10-14 23:42:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:30,058 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-14 23:42:30,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:42:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-14 23:42:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:42:30,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:30,060 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:30,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:30,264 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1585951496, now seen corresponding path program 2 times [2019-10-14 23:42:30,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:30,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954255000] [2019-10-14 23:42:30,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:30,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:30,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:30,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954255000] [2019-10-14 23:42:30,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112213758] [2019-10-14 23:42:30,406 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-10-14 23:42:30,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:42:30,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:30,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:42:30,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:30,505 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:30,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 23:42:30,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996534169] [2019-10-14 23:42:30,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:42:30,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:42:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:42:30,509 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 7 states. [2019-10-14 23:42:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:30,615 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2019-10-14 23:42:30,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:42:30,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-14 23:42:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:30,618 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:42:30,618 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:42:30,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:42:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:42:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-14 23:42:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 23:42:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-14 23:42:30,635 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 50 [2019-10-14 23:42:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:30,636 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-14 23:42:30,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:42:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-14 23:42:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:42:30,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:30,641 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:30,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:30,853 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1138062390, now seen corresponding path program 3 times [2019-10-14 23:42:30,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:30,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469741094] [2019-10-14 23:42:30,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:30,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:30,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-14 23:42:30,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469741094] [2019-10-14 23:42:30,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759433515] [2019-10-14 23:42:30,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-10-14 23:42:31,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-14 23:42:31,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:31,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:42:31,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-14 23:42:31,057 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:31,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-14 23:42:31,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291713325] [2019-10-14 23:42:31,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:42:31,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:31,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:42:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:42:31,060 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 9 states. [2019-10-14 23:42:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:31,228 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-10-14 23:42:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:42:31,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-10-14 23:42:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:31,230 INFO L225 Difference]: With dead ends: 67 [2019-10-14 23:42:31,230 INFO L226 Difference]: Without dead ends: 45 [2019-10-14 23:42:31,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:42:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-14 23:42:31,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-10-14 23:42:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 23:42:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-14 23:42:31,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 52 [2019-10-14 23:42:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:31,239 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-14 23:42:31,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:42:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-14 23:42:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:42:31,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:31,241 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:31,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:31,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash 454933031, now seen corresponding path program 4 times [2019-10-14 23:42:31,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:31,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831138255] [2019-10-14 23:42:31,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:31,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:31,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-14 23:42:31,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831138255] [2019-10-14 23:42:31,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833729261] [2019-10-14 23:42:31,556 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-14 23:42:31,611 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-14 23:42:31,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:31,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:42:31,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-14 23:42:31,669 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:31,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-14 23:42:31,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725929578] [2019-10-14 23:42:31,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:42:31,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:42:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:42:31,671 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 11 states. [2019-10-14 23:42:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:31,850 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-10-14 23:42:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:42:31,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-14 23:42:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:31,852 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:42:31,852 INFO L226 Difference]: Without dead ends: 50 [2019-10-14 23:42:31,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:42:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-14 23:42:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-10-14 23:42:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:42:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-10-14 23:42:31,868 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 66 [2019-10-14 23:42:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:31,868 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-10-14 23:42:31,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:42:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-10-14 23:42:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-14 23:42:31,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:31,872 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:32,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:32,083 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1150375548, now seen corresponding path program 5 times [2019-10-14 23:42:32,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:32,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277763465] [2019-10-14 23:42:32,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:32,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:32,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 92 proven. 15 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-14 23:42:32,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277763465] [2019-10-14 23:42:32,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83595327] [2019-10-14 23:42:32,293 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-10-14 23:42:32,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-14 23:42:32,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:32,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:42:32,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-14 23:42:32,438 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:32,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-10-14 23:42:32,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565410998] [2019-10-14 23:42:32,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:42:32,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:32,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:42:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:42:32,439 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 7 states. [2019-10-14 23:42:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:32,631 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2019-10-14 23:42:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:42:32,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-10-14 23:42:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:32,632 INFO L225 Difference]: With dead ends: 83 [2019-10-14 23:42:32,633 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 23:42:32,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:42:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 23:42:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-10-14 23:42:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 23:42:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-14 23:42:32,648 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 80 [2019-10-14 23:42:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:32,648 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-14 23:42:32,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:42:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-14 23:42:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:42:32,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:32,651 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:32,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:32,864 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:32,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1100336225, now seen corresponding path program 6 times [2019-10-14 23:42:32,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:32,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915943754] [2019-10-14 23:42:32,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:32,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:32,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-14 23:42:32,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915943754] [2019-10-14 23:42:32,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637591563] [2019-10-14 23:42:32,983 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-10-14 23:42:33,057 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-14 23:42:33,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:33,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:42:33,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 154 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-14 23:42:33,086 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:33,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-10-14 23:42:33,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022255025] [2019-10-14 23:42:33,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:42:33,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:33,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:42:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:42:33,088 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2019-10-14 23:42:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:33,265 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-10-14 23:42:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:42:33,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-14 23:42:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:33,266 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:42:33,267 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 23:42:33,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:42:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 23:42:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-10-14 23:42:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:42:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-10-14 23:42:33,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 92 [2019-10-14 23:42:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:33,275 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-10-14 23:42:33,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:42:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-10-14 23:42:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:42:33,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:33,277 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:33,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:33,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1080168600, now seen corresponding path program 7 times [2019-10-14 23:42:33,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:33,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747747997] [2019-10-14 23:42:33,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:33,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-10-14 23:42:33,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747747997] [2019-10-14 23:42:33,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846365762] [2019-10-14 23:42:33,589 INFO L92 rtionOrderModulation]: Changing assertion order to 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-10-14 23:42:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:33,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:42:33,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-14 23:42:33,707 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:33,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-14 23:42:33,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359955389] [2019-10-14 23:42:33,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:42:33,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:42:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:42:33,709 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 7 states. [2019-10-14 23:42:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:33,780 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2019-10-14 23:42:33,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:42:33,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-10-14 23:42:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:33,783 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:42:33,783 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:42:33,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:42:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:42:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-14 23:42:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 23:42:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2019-10-14 23:42:33,795 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 106 [2019-10-14 23:42:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:33,795 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2019-10-14 23:42:33,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:42:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2019-10-14 23:42:33,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:42:33,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:33,799 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:34,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:34,003 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:34,004 INFO L82 PathProgramCache]: Analyzing trace with hash 345740406, now seen corresponding path program 8 times [2019-10-14 23:42:34,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:34,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532234306] [2019-10-14 23:42:34,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:34,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-10-14 23:42:34,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532234306] [2019-10-14 23:42:34,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614689855] [2019-10-14 23:42:34,117 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-10-14 23:42:34,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:42:34,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:34,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:42:34,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 230 proven. 9 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-14 23:42:34,236 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:42:34,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-14 23:42:34,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117007018] [2019-10-14 23:42:34,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:42:34,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:42:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:42:34,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:42:34,239 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 8 states. [2019-10-14 23:42:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:42:34,340 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2019-10-14 23:42:34,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:42:34,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-10-14 23:42:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:42:34,342 INFO L225 Difference]: With dead ends: 92 [2019-10-14 23:42:34,342 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:42:34,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:42:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:42:34,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-14 23:42:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:42:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-10-14 23:42:34,355 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 108 [2019-10-14 23:42:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:42:34,356 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-10-14 23:42:34,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:42:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-10-14 23:42:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:42:34,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:42:34,358 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:42:34,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:34,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:42:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:42:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1065117484, now seen corresponding path program 9 times [2019-10-14 23:42:34,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:42:34,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352538943] [2019-10-14 23:42:34,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:34,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:42:34,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:42:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:42:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 13 proven. 379 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-10-14 23:42:35,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352538943] [2019-10-14 23:42:35,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015123657] [2019-10-14 23:42:35,500 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:42:35,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-14 23:42:35,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:42:35,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-14 23:42:35,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:42:35,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:35,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-14 23:42:35,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:42:35,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:42:35,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:42:35,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-14 23:42:36,830 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:42:36,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,834 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:42:36,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:42:36,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 51 [2019-10-14 23:42:36,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:42:36,855 INFO L567 ElimStorePlain]: treesize reduction 31, result has 50.0 percent of original size [2019-10-14 23:42:36,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:42:36,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:31 [2019-10-14 23:42:36,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:36,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:42:36,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 78 [2019-10-14 23:42:36,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:42:37,018 INFO L567 ElimStorePlain]: treesize reduction 29, result has 67.0 percent of original size [2019-10-14 23:42:37,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:37,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:42:37,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:59 [2019-10-14 23:42:37,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:39,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,516 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:42:40,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 286 [2019-10-14 23:42:40,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:42:40,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:42:40,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:42:40,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 187 [2019-10-14 23:42:40,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:40,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:42:41,034 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 48 [2019-10-14 23:42:41,035 INFO L567 ElimStorePlain]: treesize reduction 1721, result has 10.2 percent of original size [2019-10-14 23:42:41,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-14 23:42:41,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:193 [2019-10-14 23:42:41,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:42:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,027 WARN L191 SmtUtils]: Spent 14.34 s on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-14 23:43:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 23:43:02,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:43:02,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 277 [2019-10-14 23:43:02,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:43:02,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:43:02,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 190 [2019-10-14 23:43:02,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:43:02,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:43:02,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 158 [2019-10-14 23:43:02,442 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:43:02,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:43:02,678 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-14 23:43:02,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:43:02,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 77 treesize of output 411 [2019-10-14 23:43:02,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:02,937 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:43:05,326 WARN L191 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 486 DAG size of output: 77 [2019-10-14 23:43:05,326 INFO L567 ElimStorePlain]: treesize reduction 16364, result has 2.0 percent of original size [2019-10-14 23:43:05,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:05,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:05,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-10-14 23:43:05,330 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:270, output treesize:332 [2019-10-14 23:43:05,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:05,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:09,526 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2019-10-14 23:43:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 23:43:09,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:43:09,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms