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/cookify/bpl false.bpl' -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:45,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:45,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:45,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:45,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:45,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:45,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:45,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:45,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:45,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:45,822 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:45,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:45,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:45,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:45,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:45,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:45,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:45,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:45,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:45,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:45,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:45,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:45,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:45,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:45,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:45,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:45,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:45,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:45,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:45,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:45,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:45,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:45,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:45,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:45,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:45,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:45,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:45,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:45,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:45,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:45,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:45,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:45,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:45,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:45,924 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:45,925 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:45,926 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/bpl false.bpl [2019-08-05 11:21:45,926 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/bpl false.bpl' [2019-08-05 11:21:45,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:45,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:45,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:45,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:45,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:46,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,035 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:46,035 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:46,035 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:46,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:46,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:46,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:46,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:46,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/1) ... [2019-08-05 11:21:46,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:46,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:46,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:46,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:46,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (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 11:21:46,400 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTL given in one single declaration [2019-08-05 11:21:46,400 INFO L130 BoogieDeclarations]: Found specification of procedure encTL [2019-08-05 11:21:46,400 INFO L138 BoogieDeclarations]: Found implementation of procedure encTL [2019-08-05 11:21:46,401 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLR given in one single declaration [2019-08-05 11:21:46,401 INFO L130 BoogieDeclarations]: Found specification of procedure encTLR [2019-08-05 11:21:46,401 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLR [2019-08-05 11:21:46,401 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encT given in one single declaration [2019-08-05 11:21:46,402 INFO L130 BoogieDeclarations]: Found specification of procedure encT [2019-08-05 11:21:46,402 INFO L138 BoogieDeclarations]: Found implementation of procedure encT [2019-08-05 11:21:46,403 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRR given in one single declaration [2019-08-05 11:21:46,403 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRR [2019-08-05 11:21:46,403 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRR [2019-08-05 11:21:46,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRR given in one single declaration [2019-08-05 11:21:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRR [2019-08-05 11:21:46,404 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRR [2019-08-05 11:21:46,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRL given in one single declaration [2019-08-05 11:21:46,404 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRL [2019-08-05 11:21:46,405 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRL [2019-08-05 11:21:46,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRRL given in one single declaration [2019-08-05 11:21:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRRL [2019-08-05 11:21:46,406 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRRL [2019-08-05 11:21:46,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:46,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:46,407 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLRRL given in one single declaration [2019-08-05 11:21:46,407 INFO L130 BoogieDeclarations]: Found specification of procedure encTLRRL [2019-08-05 11:21:46,407 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLRRL [2019-08-05 11:21:46,408 INFO L124 BoogieDeclarations]: Specification and implementation of procedure encTLL given in one single declaration [2019-08-05 11:21:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure encTLL [2019-08-05 11:21:46,408 INFO L138 BoogieDeclarations]: Found implementation of procedure encTLL [2019-08-05 11:21:54,032 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:54,033 INFO L283 CfgBuilder]: Removed 714 assume(true) statements. [2019-08-05 11:21:54,035 INFO L202 PluginConnector]: Adding new model bpl false.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:54 BoogieIcfgContainer [2019-08-05 11:21:54,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:54,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:54,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:54,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:54,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bpl false.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:45" (1/2) ... [2019-08-05 11:21:54,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b37d0b and model type bpl false.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:54, skipping insertion in model container [2019-08-05 11:21:54,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bpl false.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:54" (2/2) ... [2019-08-05 11:21:54,043 INFO L109 eAbstractionObserver]: Analyzing ICFG bpl false.bpl [2019-08-05 11:21:54,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:54,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:54,080 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:54,107 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:54,108 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:54,108 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:54,108 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:54,108 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:54,108 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:54,109 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:54,109 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:54,109 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:54,164 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states. [2019-08-05 11:21:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:21:54,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:54,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:21:54,179 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1450960544, now seen corresponding path program 1 times [2019-08-05 11:21:54,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:54,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:54,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,335 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 11:21:54,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:54,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:21:54,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:21:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:21:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:54,354 INFO L87 Difference]: Start difference. First operand 931 states. Second operand 3 states. [2019-08-05 11:21:54,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:54,567 INFO L93 Difference]: Finished difference Result 931 states and 1669 transitions. [2019-08-05 11:21:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:21:54,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:21:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:54,593 INFO L225 Difference]: With dead ends: 931 [2019-08-05 11:21:54,594 INFO L226 Difference]: Without dead ends: 358 [2019-08-05 11:21:54,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:21:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-08-05 11:21:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-08-05 11:21:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 11:21:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 646 transitions. [2019-08-05 11:21:54,654 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 646 transitions. Word has length 5 [2019-08-05 11:21:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:54,654 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 646 transitions. [2019-08-05 11:21:54,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:21:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 646 transitions. [2019-08-05 11:21:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:54,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:54,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:54,655 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1310808114, now seen corresponding path program 1 times [2019-08-05 11:21:54,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:54,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:54,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:54,740 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 11:21:54,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:54,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:21:54,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:54,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:54,743 INFO L87 Difference]: Start difference. First operand 358 states and 646 transitions. Second operand 4 states. [2019-08-05 11:21:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:55,104 INFO L93 Difference]: Finished difference Result 534 states and 964 transitions. [2019-08-05 11:21:55,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:55,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:21:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:55,114 INFO L225 Difference]: With dead ends: 534 [2019-08-05 11:21:55,114 INFO L226 Difference]: Without dead ends: 532 [2019-08-05 11:21:55,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-08-05 11:21:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 358. [2019-08-05 11:21:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-05 11:21:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 642 transitions. [2019-08-05 11:21:55,161 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 642 transitions. Word has length 10 [2019-08-05 11:21:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:55,163 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 642 transitions. [2019-08-05 11:21:55,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 642 transitions. [2019-08-05 11:21:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:21:55,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:55,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:55,165 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1886101594, now seen corresponding path program 1 times [2019-08-05 11:21:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:55,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:55,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:55,262 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 11:21:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:55,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:55,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:55,264 INFO L87 Difference]: Start difference. First operand 358 states and 642 transitions. Second operand 4 states. [2019-08-05 11:21:55,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:55,702 INFO L93 Difference]: Finished difference Result 548 states and 974 transitions. [2019-08-05 11:21:55,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:55,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:21:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:55,711 INFO L225 Difference]: With dead ends: 548 [2019-08-05 11:21:55,711 INFO L226 Difference]: Without dead ends: 548 [2019-08-05 11:21:55,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-08-05 11:21:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 366. [2019-08-05 11:21:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-08-05 11:21:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 650 transitions. [2019-08-05 11:21:55,725 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 650 transitions. Word has length 13 [2019-08-05 11:21:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:55,725 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 650 transitions. [2019-08-05 11:21:55,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 650 transitions. [2019-08-05 11:21:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:55,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:55,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:55,727 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1947064182, now seen corresponding path program 1 times [2019-08-05 11:21:55,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:55,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:55,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:55,782 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 11:21:55,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:55,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:55,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:55,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:55,784 INFO L87 Difference]: Start difference. First operand 366 states and 650 transitions. Second operand 4 states. [2019-08-05 11:21:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,523 INFO L93 Difference]: Finished difference Result 560 states and 977 transitions. [2019-08-05 11:21:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:56,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-08-05 11:21:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,528 INFO L225 Difference]: With dead ends: 560 [2019-08-05 11:21:56,528 INFO L226 Difference]: Without dead ends: 560 [2019-08-05 11:21:56,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-08-05 11:21:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 366. [2019-08-05 11:21:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-08-05 11:21:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 646 transitions. [2019-08-05 11:21:56,543 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 646 transitions. Word has length 16 [2019-08-05 11:21:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,543 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 646 transitions. [2019-08-05 11:21:56,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 646 transitions. [2019-08-05 11:21:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:21:56,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:56,546 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash 314088992, now seen corresponding path program 1 times [2019-08-05 11:21:56,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,805 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 11:21:56,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:56,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:21:56,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:21:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:21:56,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:56,806 INFO L87 Difference]: Start difference. First operand 366 states and 646 transitions. Second operand 5 states. [2019-08-05 11:21:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:57,994 INFO L93 Difference]: Finished difference Result 615 states and 1067 transitions. [2019-08-05 11:21:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:21:57,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-08-05 11:21:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:57,999 INFO L225 Difference]: With dead ends: 615 [2019-08-05 11:21:58,000 INFO L226 Difference]: Without dead ends: 615 [2019-08-05 11:21:58,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:21:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-08-05 11:21:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 370. [2019-08-05 11:21:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-08-05 11:21:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 650 transitions. [2019-08-05 11:21:58,012 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 650 transitions. Word has length 16 [2019-08-05 11:21:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:58,012 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 650 transitions. [2019-08-05 11:21:58,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:21:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 650 transitions. [2019-08-05 11:21:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:21:58,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:58,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:58,017 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -377844114, now seen corresponding path program 1 times [2019-08-05 11:21:58,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:58,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:21:58,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:58,128 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 11:21:58,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:58,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:21:58,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:21:58,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:21:58,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:21:58,130 INFO L87 Difference]: Start difference. First operand 370 states and 650 transitions. Second operand 6 states. [2019-08-05 11:21:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,352 INFO L93 Difference]: Finished difference Result 327 states and 525 transitions. [2019-08-05 11:21:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:21:59,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-08-05 11:21:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,355 INFO L225 Difference]: With dead ends: 327 [2019-08-05 11:21:59,355 INFO L226 Difference]: Without dead ends: 327 [2019-08-05 11:21:59,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:21:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-08-05 11:21:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2019-08-05 11:21:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:21:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 406 transitions. [2019-08-05 11:21:59,363 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 406 transitions. Word has length 19 [2019-08-05 11:21:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,363 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 406 transitions. [2019-08-05 11:21:59,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:21:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 406 transitions. [2019-08-05 11:21:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:21:59,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:59,365 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1320510795, now seen corresponding path program 1 times [2019-08-05 11:21:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,422 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 11:21:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:59,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:59,423 INFO L87 Difference]: Start difference. First operand 242 states and 406 transitions. Second operand 4 states. [2019-08-05 11:21:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,506 INFO L93 Difference]: Finished difference Result 149 states and 237 transitions. [2019-08-05 11:21:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:59,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 11:21:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,515 INFO L225 Difference]: With dead ends: 149 [2019-08-05 11:21:59,515 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 11:21:59,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 11:21:59,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2019-08-05 11:21:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:21:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 224 transitions. [2019-08-05 11:21:59,520 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 224 transitions. Word has length 21 [2019-08-05 11:21:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,520 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 224 transitions. [2019-08-05 11:21:59,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 224 transitions. [2019-08-05 11:21:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:21:59,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,521 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:59,522 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1591875817, now seen corresponding path program 1 times [2019-08-05 11:21:59,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,577 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 11:21:59,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:59,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:59,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:59,579 INFO L87 Difference]: Start difference. First operand 138 states and 224 transitions. Second operand 4 states. [2019-08-05 11:21:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,701 INFO L93 Difference]: Finished difference Result 206 states and 324 transitions. [2019-08-05 11:21:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:21:59,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-08-05 11:21:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,713 INFO L225 Difference]: With dead ends: 206 [2019-08-05 11:21:59,713 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 11:21:59,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:21:59,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 11:21:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 134. [2019-08-05 11:21:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:21:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 215 transitions. [2019-08-05 11:21:59,719 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 215 transitions. Word has length 24 [2019-08-05 11:21:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,719 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 215 transitions. [2019-08-05 11:21:59,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 215 transitions. [2019-08-05 11:21:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:21:59,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,720 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:59,720 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1334249322, now seen corresponding path program 1 times [2019-08-05 11:21:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:59,816 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 11:21:59,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:59,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-08-05 11:21:59,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:21:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:21:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:59,817 INFO L87 Difference]: Start difference. First operand 134 states and 215 transitions. Second operand 8 states. [2019-08-05 11:22:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:00,826 INFO L93 Difference]: Finished difference Result 463 states and 680 transitions. [2019-08-05 11:22:00,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:22:00,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 11:22:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:00,829 INFO L225 Difference]: With dead ends: 463 [2019-08-05 11:22:00,829 INFO L226 Difference]: Without dead ends: 463 [2019-08-05 11:22:00,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:22:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-08-05 11:22:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 138. [2019-08-05 11:22:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:22:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 219 transitions. [2019-08-05 11:22:00,836 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 219 transitions. Word has length 24 [2019-08-05 11:22:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:00,836 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 219 transitions. [2019-08-05 11:22:00,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:22:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 219 transitions. [2019-08-05 11:22:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:22:00,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:00,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:22:00,838 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1395162957, now seen corresponding path program 1 times [2019-08-05 11:22:00,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:00,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:22:00,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:00,968 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 11:22:00,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:22:00,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:22:00,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:22:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:22:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:22:00,969 INFO L87 Difference]: Start difference. First operand 138 states and 219 transitions. Second operand 4 states. [2019-08-05 11:22:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:01,046 INFO L93 Difference]: Finished difference Result 250 states and 375 transitions. [2019-08-05 11:22:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:22:01,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-08-05 11:22:01,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:01,049 INFO L225 Difference]: With dead ends: 250 [2019-08-05 11:22:01,049 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 11:22:01,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:22:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 11:22:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 138. [2019-08-05 11:22:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:22:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 211 transitions. [2019-08-05 11:22:01,053 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 211 transitions. Word has length 27 [2019-08-05 11:22:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:01,054 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 211 transitions. [2019-08-05 11:22:01,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:22:01,054 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 211 transitions. [2019-08-05 11:22:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:22:01,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:01,055 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:22:01,055 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:01,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1107827388, now seen corresponding path program 1 times [2019-08-05 11:22:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:01,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:22:01,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:01,127 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 11:22:01,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:22:01,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-08-05 11:22:01,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:22:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:22:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:22:01,128 INFO L87 Difference]: Start difference. First operand 138 states and 211 transitions. Second operand 7 states. [2019-08-05 11:22:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,045 INFO L93 Difference]: Finished difference Result 456 states and 674 transitions. [2019-08-05 11:22:02,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:22:02,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-08-05 11:22:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,049 INFO L225 Difference]: With dead ends: 456 [2019-08-05 11:22:02,049 INFO L226 Difference]: Without dead ends: 456 [2019-08-05 11:22:02,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:22:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-08-05 11:22:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 142. [2019-08-05 11:22:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 11:22:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2019-08-05 11:22:02,054 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 29 [2019-08-05 11:22:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,054 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2019-08-05 11:22:02,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:22:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2019-08-05 11:22:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:22:02,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,056 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:22:02,056 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash -28554450, now seen corresponding path program 1 times [2019-08-05 11:22:02,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:02,114 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 11:22:02,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:22:02,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:22:02,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:22:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:22:02,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:22:02,116 INFO L87 Difference]: Start difference. First operand 142 states and 215 transitions. Second operand 4 states. [2019-08-05 11:22:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,159 INFO L93 Difference]: Finished difference Result 215 states and 320 transitions. [2019-08-05 11:22:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:22:02,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-08-05 11:22:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,161 INFO L225 Difference]: With dead ends: 215 [2019-08-05 11:22:02,162 INFO L226 Difference]: Without dead ends: 215 [2019-08-05 11:22:02,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:22:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-08-05 11:22:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 139. [2019-08-05 11:22:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:22:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 211 transitions. [2019-08-05 11:22:02,166 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 211 transitions. Word has length 30 [2019-08-05 11:22:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,166 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 211 transitions. [2019-08-05 11:22:02,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:22:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 211 transitions. [2019-08-05 11:22:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:22:02,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,168 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:22:02,168 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1181604373, now seen corresponding path program 1 times [2019-08-05 11:22:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:02,250 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 11:22:02,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:22:02,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:22:02,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:22:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:22:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:22:02,252 INFO L87 Difference]: Start difference. First operand 139 states and 211 transitions. Second operand 6 states. [2019-08-05 11:22:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,871 INFO L93 Difference]: Finished difference Result 733 states and 1065 transitions. [2019-08-05 11:22:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:22:02,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-08-05 11:22:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,875 INFO L225 Difference]: With dead ends: 733 [2019-08-05 11:22:02,875 INFO L226 Difference]: Without dead ends: 733 [2019-08-05 11:22:02,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:22:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-08-05 11:22:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 187. [2019-08-05 11:22:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-08-05 11:22:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2019-08-05 11:22:02,882 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 31 [2019-08-05 11:22:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,882 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2019-08-05 11:22:02,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:22:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2019-08-05 11:22:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:22:02,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,884 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:22:02,884 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash -857610386, now seen corresponding path program 1 times [2019-08-05 11:22:02,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:22:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:22:02,953 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:22:02,988 INFO L202 PluginConnector]: Adding new model bpl false.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:22:02 BoogieIcfgContainer [2019-08-05 11:22:02,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:22:02,990 INFO L168 Benchmark]: Toolchain (without parser) took 16993.98 ms. Allocated memory was 134.7 MB in the beginning and 348.7 MB in the end (delta: 213.9 MB). Free memory was 111.9 MB in the beginning and 139.7 MB in the end (delta: -27.8 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,991 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.03 ms. Allocated memory is still 134.7 MB. Free memory was 111.9 MB in the beginning and 98.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,993 INFO L168 Benchmark]: Boogie Preprocessor took 185.84 ms. Allocated memory is still 134.7 MB. Free memory was 98.4 MB in the beginning and 90.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,994 INFO L168 Benchmark]: RCFGBuilder took 7711.93 ms. Allocated memory was 134.7 MB in the beginning and 231.7 MB in the end (delta: 97.0 MB). Free memory was 90.5 MB in the beginning and 68.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 136.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,995 INFO L168 Benchmark]: TraceAbstraction took 8951.56 ms. Allocated memory was 231.7 MB in the beginning and 348.7 MB in the end (delta: 116.9 MB). Free memory was 68.5 MB in the beginning and 139.7 MB in the end (delta: -71.2 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:22:02,999 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.20 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 140.03 ms. Allocated memory is still 134.7 MB. Free memory was 111.9 MB in the beginning and 98.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 185.84 ms. Allocated memory is still 134.7 MB. Free memory was 98.4 MB in the beginning and 90.5 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7711.93 ms. Allocated memory was 134.7 MB in the beginning and 231.7 MB in the end (delta: 97.0 MB). Free memory was 90.5 MB in the beginning and 68.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 136.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8951.56 ms. Allocated memory was 231.7 MB in the beginning and 348.7 MB in the end (delta: 116.9 MB). Free memory was 68.5 MB in the beginning and 139.7 MB in the end (delta: -71.2 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: assertion can be violated assertion can be violated We found a FailurePath: [L4] havoc warn, mad, t, tn; [L5] pp := 0; [L14] warn := awarn; [L15] mad := amad; [L16] t := at; [L17] tn := atn; [L18] COND FALSE !(pp == 4) [L19] COND FALSE !(pp == 5) [L20] COND FALSE !(pp == 7) [L21] COND FALSE !(pp == 8) [L23] havoc tn; [L24] t := tn - 10; [L27] assume t > 13; [L28] warn := true; [L75] ret := !warn; [L66] COND FALSE !(ret) [L82] warn := awarn; [L83] mad := amad; [L84] t := at; [L85] tn := atn; [L86] COND TRUE pp == 3 [L137] ret := warn; [L100] COND FALSE !(!ret) [L104] mad := true; [L137] ret := warn; [L108] COND FALSE !(!ret) [L91] havoc tn; [L92] t := tn - 10; [L114] assume t <= 13; [L115] warn := false; [L137] ret := warn; [L119] COND TRUE !ret [L157] warn := awarn; [L158] mad := amad; [L159] t := at; [L160] tn := atn; [L161] COND FALSE !(pp == 3) [L162] COND FALSE !(pp == 4) [L163] COND TRUE pp == 7 [L207] ret := mad; [L192] COND FALSE !(!ret) [L195] mad := false; [L207] ret := mad; [L199] COND TRUE !ret [L200] ret := false; [L32] COND TRUE !ret [L33] ret := false; [L7] assert ret != false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 931 locations, 1 error locations. UNSAFE Result, 8.8s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8169 SDtfs, 7049 SDslu, 13049 SDs, 0 SdLazy, 1870 SolverSat, 439 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=931occurred in iteration=0, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2336 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 6189 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1143 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...