java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:56:48,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:56:48,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:56:48,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:56:48,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:56:48,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:56:48,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:56:48,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:56:48,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:56:48,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:56:48,690 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:56:48,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:56:48,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:56:48,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:56:48,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:56:48,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:56:48,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:56:48,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:56:48,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:56:48,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:56:48,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:56:48,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:56:48,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:56:48,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:56:48,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:56:48,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:56:48,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:56:48,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:56:48,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:56:48,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:56:48,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:56:48,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:56:48,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:56:48,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:56:48,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:56:48,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:56:48,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:56:48,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:56:48,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:56:48,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:56:48,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:56:48,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:56:48,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:56:48,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:56:48,769 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:56:48,770 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:56:48,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_11.bpl [2019-08-05 10:56:48,772 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_11.bpl' [2019-08-05 10:56:48,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:56:48,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:56:48,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:48,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:56:48,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:56:48,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:48,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:56:48,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:56:48,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:56:48,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/1) ... [2019-08-05 10:56:48,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:56:48,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:56:48,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:56:48,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:56:48,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:56:49,027 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:56:49,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:56:49,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:56:49,344 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:56:49,345 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:56:49,347 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:49 BoogieIcfgContainer [2019-08-05 10:56:49,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:56:49,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:56:49,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:56:49,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:56:49,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:48" (1/2) ... [2019-08-05 10:56:49,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ea5b6a and model type test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:56:49, skipping insertion in model container [2019-08-05 10:56:49,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:49" (2/2) ... [2019-08-05 10:56:49,362 INFO L109 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i_11.bpl [2019-08-05 10:56:49,371 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:56:49,385 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:56:49,402 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:56:49,433 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:56:49,433 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:56:49,434 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:56:49,434 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:56:49,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:56:49,434 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:56:49,434 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:56:49,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:56:49,435 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:56:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:56:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:56:49,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:49,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:56:49,458 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 10:56:49,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:49,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:56:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:49,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:56:49,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:56:49,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:56:49,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:56:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:56:49,761 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:56:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:49,805 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:56:49,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:56:49,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:56:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:49,817 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:56:49,818 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:56:49,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:56:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:56:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:56:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:56:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:56:49,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:56:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:49,850 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:56:49,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:56:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:56:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:56:49,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:49,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:56:49,852 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:49,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 10:56:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:49,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:56:49,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:50,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:50,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:56:50,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:56:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:56:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:56:50,021 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:56:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:50,065 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:56:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:56:50,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:56:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:50,066 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:56:50,066 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:56:50,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:56:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:56:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:56:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:56:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:56:50,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:56:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:50,071 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:56:50,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:56:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:56:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:56:50,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:50,072 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:56:50,072 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 10:56:50,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:50,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:56:50,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:50,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:50,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:56:50,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:56:50,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:56:50,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:56:50,300 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:56:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:50,338 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:56:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:56:50,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:56:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:50,339 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:56:50,339 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:56:50,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:56:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:56:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:56:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:56:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:56:50,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:56:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:50,342 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:56:50,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:56:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:56:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:56:50,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:50,343 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:56:50,343 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:50,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:50,343 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 10:56:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:50,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:56:50,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:50,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:50,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:56:50,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:56:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:56:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:56:50,680 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:56:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:50,743 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:56:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:56:50,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:56:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:50,745 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:56:50,745 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:56:50,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:56:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:56:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:56:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:56:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:56:50,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:56:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:50,749 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:56:50,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:56:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:56:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:56:50,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:50,750 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:56:50,751 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 10:56:50,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:50,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:56:50,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:50,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:50,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:56:50,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:56:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:56:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:56:50,977 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:56:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:51,027 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:56:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:56:51,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:56:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:51,030 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:56:51,030 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:56:51,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:56:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:56:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:56:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:56:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:56:51,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:56:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:51,033 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:56:51,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:56:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:56:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:56:51,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:51,034 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:56:51,034 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894151, now seen corresponding path program 5 times [2019-08-05 10:56:51,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:51,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:56:51,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:51,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:56:51,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:56:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:56:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:56:51,341 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:56:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:51,374 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:56:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:56:51,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:56:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:51,375 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:56:51,376 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:56:51,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:56:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:56:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:56:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:56:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:56:51,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:56:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:51,379 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:56:51,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:56:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:56:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:56:51,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:51,380 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:56:51,380 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141857, now seen corresponding path program 6 times [2019-08-05 10:56:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:51,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:56:51,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:51,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:51,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:56:51,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:56:51,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:56:51,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:56:51,875 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:56:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:51,920 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:56:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:56:51,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:56:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:51,922 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:56:51,922 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:56:51,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:56:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:56:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:56:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:56:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:56:51,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:56:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:51,925 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:56:51,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:56:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:56:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:56:51,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:51,926 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:56:51,927 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:51,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820743, now seen corresponding path program 7 times [2019-08-05 10:56:51,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:51,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:56:51,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:52,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:56:52,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:56:52,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:56:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:56:52,449 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:56:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:52,499 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:56:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:56:52,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:56:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:52,500 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:56:52,500 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:56:52,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:56:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:56:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:56:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:56:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:56:52,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:56:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:52,505 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:56:52,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:56:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:56:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:56:52,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:52,506 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:56:52,506 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166495, now seen corresponding path program 8 times [2019-08-05 10:56:52,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:52,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:56:52,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:52,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:56:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:56:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:56:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:56:52,714 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:56:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:52,797 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:56:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:56:52,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:56:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:52,799 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:56:52,799 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:56:52,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:56:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:56:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:56:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:56:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:56:52,803 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:56:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:52,803 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:56:52,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:56:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:56:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:56:52,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:52,804 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:56:52,804 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -562523065, now seen corresponding path program 9 times [2019-08-05 10:56:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:52,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:56:52,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:53,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:53,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:56:53,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:56:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:56:53,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:56:53,029 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:56:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:53,091 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:56:53,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:56:53,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:56:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:53,096 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:56:53,096 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:56:53,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:56:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:56:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:56:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:56:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:56:53,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:56:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:53,099 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:56:53,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:56:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:56:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:56:53,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:53,100 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:56:53,100 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash -258347807, now seen corresponding path program 10 times [2019-08-05 10:56:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:53,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:56:53,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:53,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:53,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:53,430 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-08-05 10:56:53,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:53,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 50 [2019-08-05 10:56:53,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:53,644 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-08-05 10:56:53,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:53,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:53,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:69 [2019-08-05 10:56:53,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:53,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:53,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:53,858 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-08-05 10:56:53,858 INFO L341 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2019-08-05 10:56:53,859 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 58 treesize of output 78 [2019-08-05 10:56:53,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:53,958 INFO L567 ElimStorePlain]: treesize reduction 11, result has 87.5 percent of original size [2019-08-05 10:56:53,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:56:53,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:77 [2019-08-05 10:56:54,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:54,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:54,086 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:54,577 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 110 [2019-08-05 10:56:54,578 INFO L341 Elim1Store]: treesize reduction 28, result has 91.9 percent of original size [2019-08-05 10:56:54,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 73 treesize of output 349 [2019-08-05 10:56:54,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:54,955 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2019-08-05 10:56:54,956 INFO L567 ElimStorePlain]: treesize reduction 330, result has 22.0 percent of original size [2019-08-05 10:56:54,958 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-08-05 10:56:54,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:93 [2019-08-05 10:56:55,074 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:55,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:55,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:55,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:56,445 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 210 DAG size of output: 194 [2019-08-05 10:56:56,445 INFO L341 Elim1Store]: treesize reduction 58, result has 90.8 percent of original size [2019-08-05 10:56:56,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 604 [2019-08-05 10:56:56,451 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,456 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:56,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:57,308 WARN L188 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 57 [2019-08-05 10:56:57,309 INFO L567 ElimStorePlain]: treesize reduction 1476, result has 7.1 percent of original size [2019-08-05 10:56:57,310 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 1 xjuncts. [2019-08-05 10:56:57,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:56:57,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:57,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:57,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:58,657 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 210 DAG size of output: 196 [2019-08-05 10:56:58,658 INFO L341 Elim1Store]: treesize reduction 50, result has 92.1 percent of original size [2019-08-05 10:56:58,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 612 [2019-08-05 10:56:58,663 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,664 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,667 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,668 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,672 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:56:58,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,450 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 57 [2019-08-05 10:56:59,450 INFO L567 ElimStorePlain]: treesize reduction 1495, result has 7.0 percent of original size [2019-08-05 10:56:59,452 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 1 xjuncts. [2019-08-05 10:56:59,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:56:59,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:59,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,595 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:56:59,596 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:00,725 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 210 DAG size of output: 194 [2019-08-05 10:57:00,726 INFO L341 Elim1Store]: treesize reduction 58, result has 90.8 percent of original size [2019-08-05 10:57:00,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 604 [2019-08-05 10:57:00,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,732 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:00,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:01,325 WARN L188 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 57 [2019-08-05 10:57:01,325 INFO L567 ElimStorePlain]: treesize reduction 1478, result has 7.1 percent of original size [2019-08-05 10:57:01,327 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 1 xjuncts. [2019-08-05 10:57:01,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:57:01,367 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:01,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:01,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:02,559 WARN L188 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 210 DAG size of output: 194 [2019-08-05 10:57:02,560 INFO L341 Elim1Store]: treesize reduction 58, result has 90.8 percent of original size [2019-08-05 10:57:02,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 604 [2019-08-05 10:57:02,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,570 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:02,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,217 WARN L188 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 57 [2019-08-05 10:57:03,218 INFO L567 ElimStorePlain]: treesize reduction 1494, result has 7.0 percent of original size [2019-08-05 10:57:03,219 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 1 xjuncts. [2019-08-05 10:57:03,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:57:03,305 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:03,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:03,343 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:04,476 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 210 DAG size of output: 195 [2019-08-05 10:57:04,477 INFO L341 Elim1Store]: treesize reduction 54, result has 91.4 percent of original size [2019-08-05 10:57:04,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 608 [2019-08-05 10:57:04,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,485 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:04,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,162 WARN L188 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 57 [2019-08-05 10:57:05,163 INFO L567 ElimStorePlain]: treesize reduction 1497, result has 7.0 percent of original size [2019-08-05 10:57:05,164 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 1 xjuncts. [2019-08-05 10:57:05,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:57:05,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:05,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,256 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:05,257 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:06,287 WARN L188 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 210 DAG size of output: 195 [2019-08-05 10:57:06,288 INFO L341 Elim1Store]: treesize reduction 54, result has 91.4 percent of original size [2019-08-05 10:57:06,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 608 [2019-08-05 10:57:06,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:06,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:06,992 WARN L188 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 57 [2019-08-05 10:57:06,992 INFO L567 ElimStorePlain]: treesize reduction 1518, result has 6.9 percent of original size [2019-08-05 10:57:06,993 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 1 xjuncts. [2019-08-05 10:57:06,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:57:07,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:07,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:07,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:08,134 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 210 DAG size of output: 195 [2019-08-05 10:57:08,135 INFO L341 Elim1Store]: treesize reduction 54, result has 91.4 percent of original size [2019-08-05 10:57:08,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 608 [2019-08-05 10:57:08,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,142 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,143 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:08,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:08,639 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 57 [2019-08-05 10:57:08,640 INFO L567 ElimStorePlain]: treesize reduction 1481, result has 7.1 percent of original size [2019-08-05 10:57:08,642 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 1 xjuncts. [2019-08-05 10:57:08,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:113 [2019-08-05 10:57:08,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:08,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:08,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,785 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:09,787 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 210 DAG size of output: 195 [2019-08-05 10:57:09,787 INFO L341 Elim1Store]: treesize reduction 54, result has 91.4 percent of original size [2019-08-05 10:57:09,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 15 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 84 treesize of output 608 [2019-08-05 10:57:09,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,796 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:09,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:10,414 WARN L188 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 55 [2019-08-05 10:57:10,414 INFO L567 ElimStorePlain]: treesize reduction 1530, result has 6.7 percent of original size [2019-08-05 10:57:10,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:10,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:114, output treesize:110 [2019-08-05 10:57:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 10:57:10,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:10,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:57:10,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:57:10,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:57:10,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:10,478 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2019-08-05 10:57:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:10,538 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:57:10,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:57:10,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-08-05 10:57:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:10,539 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:57:10,540 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:57:10,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:57:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:57:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:57:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:57:10,542 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-08-05 10:57:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:10,542 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:57:10,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:57:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:57:10,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:57:10,547 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:57:10 BoogieIcfgContainer [2019-08-05 10:57:10,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:57:10,549 INFO L168 Benchmark]: Toolchain (without parser) took 21699.33 ms. Allocated memory was 141.0 MB in the beginning and 379.1 MB in the end (delta: 238.0 MB). Free memory was 107.9 MB in the beginning and 62.1 MB in the end (delta: 45.8 MB). Peak memory consumption was 283.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,550 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 141.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.95 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 106.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,551 INFO L168 Benchmark]: Boogie Preprocessor took 52.91 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,552 INFO L168 Benchmark]: RCFGBuilder took 394.11 ms. Allocated memory is still 141.0 MB. Free memory was 104.5 MB in the beginning and 89.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,553 INFO L168 Benchmark]: TraceAbstraction took 21197.97 ms. Allocated memory was 141.0 MB in the beginning and 379.1 MB in the end (delta: 238.0 MB). Free memory was 89.3 MB in the beginning and 62.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 265.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:10,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 141.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.95 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 106.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.91 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.11 ms. Allocated memory is still 141.0 MB. Free memory was 104.5 MB in the beginning and 89.5 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21197.97 ms. Allocated memory was 141.0 MB in the beginning and 379.1 MB in the end (delta: 238.0 MB). Free memory was 89.3 MB in the beginning and 62.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 265.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 21.1s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 102 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 77 ConstructedInterpolants, 9 QuantifiedInterpolants, 15373 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1210 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 36/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...