java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:53:55,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:53:55,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:53:55,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:53:55,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:53:55,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:53:55,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:53:55,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:53:55,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:53:55,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:53:55,356 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:53:55,356 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:53:55,357 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:53:55,358 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:53:55,359 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:53:55,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:53:55,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:53:55,363 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:53:55,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:53:55,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:53:55,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:53:55,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:53:55,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:53:55,371 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:53:55,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:53:55,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:53:55,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:53:55,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:53:55,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:53:55,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:53:55,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:53:55,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:53:55,378 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:53:55,378 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:53:55,379 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:53:55,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:53:55,380 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:53:55,394 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:53:55,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:53:55,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:53:55,396 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:53:55,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:53:55,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:53:55,397 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:53:55,397 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:53:55,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:53:55,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:53:55,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:53:55,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:53:55,464 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:53:55,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-07-23 13:53:55,465 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-07-23 13:53:55,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:53:55,517 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:53:55,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:53:55,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:53:55,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:53:55,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:53:55,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:53:55,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:53:55,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:53:55,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/1) ... [2018-07-23 13:53:55,658 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-23 13:53:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 13:53:55,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 13:53:55,840 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:53:55,841 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:53:55 BoogieIcfgContainer [2018-07-23 13:53:55,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:53:55,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:53:55,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:53:55,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:53:55,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:53:55" (1/2) ... [2018-07-23 13:53:55,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5687d6f4 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:53:55, skipping insertion in model container [2018-07-23 13:53:55,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:53:55" (2/2) ... [2018-07-23 13:53:55,854 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-07-23 13:53:55,865 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:53:55,875 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:53:55,921 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:53:55,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:53:55,922 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:53:55,923 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:53:55,923 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:53:55,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:53:55,923 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:53:55,923 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:53:55,924 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:53:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 13:53:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:53:55,945 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:55,946 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:53:55,947 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-07-23 13:53:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,027 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:53:56,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:53:56,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,030 INFO L185 omatonBuilderFactory]: Interpolants [9#true, 10#false, 11#(<= main_x 0)] [2018-07-23 13:53:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,032 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:53:56,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:53:56,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:53:56,050 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 13:53:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,079 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-23 13:53:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:53:56,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:53:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,091 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:53:56,091 INFO L226 Difference]: Without dead ends: 5 [2018-07-23 13:53:56,095 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:53:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-23 13:53:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-23 13:53:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-23 13:53:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-23 13:53:56,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-23 13:53:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,140 INFO L471 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-23 13:53:56,140 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:53:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-23 13:53:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:53:56,141 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,141 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:53:56,141 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,142 INFO L82 PathProgramCache]: Analyzing trace with hash 945112, now seen corresponding path program 1 times [2018-07-23 13:53:56,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,169 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:56,169 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:53:56,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,170 INFO L185 omatonBuilderFactory]: Interpolants [48#true, 49#false, 50#(<= main_x 0), 51#(<= main_x 2)] [2018-07-23 13:53:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,173 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:53:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:53:56,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:53:56,174 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-23 13:53:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,189 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-23 13:53:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:53:56,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 13:53:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,190 INFO L225 Difference]: With dead ends: 8 [2018-07-23 13:53:56,191 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 13:53:56,192 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:53:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 13:53:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 13:53:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:53:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-23 13:53:56,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-23 13:53:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,195 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-23 13:53:56,196 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:53:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-23 13:53:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:53:56,196 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,196 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-23 13:53:56,197 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,197 INFO L82 PathProgramCache]: Analyzing trace with hash 29306144, now seen corresponding path program 2 times [2018-07-23 13:53:56,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,249 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:56,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:53:56,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,251 INFO L185 omatonBuilderFactory]: Interpolants [80#true, 81#false, 82#(<= main_x 0), 83#(<= main_x 2), 84#(<= main_x 4)] [2018-07-23 13:53:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,251 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:53:56,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:53:56,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:53:56,252 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-23 13:53:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,265 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-23 13:53:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:53:56,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-23 13:53:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,266 INFO L225 Difference]: With dead ends: 9 [2018-07-23 13:53:56,266 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:53:56,267 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:53:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:53:56,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:53:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:53:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 13:53:56,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-23 13:53:56,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,270 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 13:53:56,271 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:53:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 13:53:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:53:56,271 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,271 INFO L357 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-23 13:53:56,272 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash 908498136, now seen corresponding path program 3 times [2018-07-23 13:53:56,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:56,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:53:56,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,355 INFO L185 omatonBuilderFactory]: Interpolants [117#true, 118#false, 119#(<= main_x 0), 120#(<= main_x 2), 121#(<= main_x 4), 122#(<= main_x 6)] [2018-07-23 13:53:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,356 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:53:56,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:53:56,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:53:56,357 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-23 13:53:56,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,382 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-23 13:53:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:53:56,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-23 13:53:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,383 INFO L225 Difference]: With dead ends: 10 [2018-07-23 13:53:56,383 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:53:56,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:53:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:53:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:53:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:53:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-23 13:53:56,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-23 13:53:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-23 13:53:56,388 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:53:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-23 13:53:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:53:56,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,389 INFO L357 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-23 13:53:56,389 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321184, now seen corresponding path program 4 times [2018-07-23 13:53:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:56,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:53:56,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,490 INFO L185 omatonBuilderFactory]: Interpolants [160#false, 161#(<= main_x 0), 162#(<= main_x 2), 163#(<= main_x 4), 164#(<= main_x 6), 165#(<= main_x 8), 159#true] [2018-07-23 13:53:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,490 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:53:56,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:53:56,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:53:56,493 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-23 13:53:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,523 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 13:53:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:53:56,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-23 13:53:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,524 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:53:56,524 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:53:56,528 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:53:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:53:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:53:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:53:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 13:53:56,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 13:53:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,533 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 13:53:56,533 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:53:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 13:53:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:53:56,534 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,534 INFO L357 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-23 13:53:56,534 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593112, now seen corresponding path program 5 times [2018-07-23 13:53:56,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,719 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:56,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:53:56,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,720 INFO L185 omatonBuilderFactory]: Interpolants [208#(<= main_x 0), 209#(<= main_x 2), 210#(<= main_x 4), 211#(<= main_x 6), 212#(<= main_x 8), 213#(<= main_x 10), 206#true, 207#false] [2018-07-23 13:53:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:56,721 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:53:56,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:53:56,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:53:56,722 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-23 13:53:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:56,734 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-23 13:53:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:53:56,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-23 13:53:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:56,736 INFO L225 Difference]: With dead ends: 12 [2018-07-23 13:53:56,736 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:53:56,737 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:53:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:53:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:53:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:53:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-23 13:53:56,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-23 13:53:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:56,744 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-23 13:53:56,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:53:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-23 13:53:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:53:56,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:56,745 INFO L357 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-23 13:53:56,745 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311520, now seen corresponding path program 6 times [2018-07-23 13:53:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:57,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:53:57,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,114 INFO L185 omatonBuilderFactory]: Interpolants [258#true, 259#false, 260#(<= main_x 0), 261#(<= main_x 2), 262#(<= main_x 4), 263#(<= main_x 6), 264#(<= main_x 8), 265#(<= main_x 10), 266#(<= main_x 12)] [2018-07-23 13:53:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:53:57,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:53:57,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:53:57,117 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-23 13:53:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:57,139 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 13:53:57,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:53:57,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-23 13:53:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:57,140 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:53:57,140 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:53:57,141 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:53:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:53:57,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:53:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:53:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 13:53:57,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-23 13:53:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:57,153 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 13:53:57,153 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:53:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 13:53:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:53:57,155 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:57,155 INFO L357 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-23 13:53:57,155 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash -223074600, now seen corresponding path program 7 times [2018-07-23 13:53:57,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:57,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:53:57,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,654 INFO L185 omatonBuilderFactory]: Interpolants [320#(<= main_x 6), 321#(<= main_x 8), 322#(<= main_x 10), 323#(<= main_x 12), 324#(<= main_x 14), 315#true, 316#false, 317#(<= main_x 0), 318#(<= main_x 2), 319#(<= main_x 4)] [2018-07-23 13:53:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:57,659 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:53:57,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:53:57,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:53:57,663 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-23 13:53:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:57,681 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-23 13:53:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:53:57,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-23 13:53:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:57,683 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:53:57,684 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:53:57,684 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:53:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:53:57,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:53:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:53:57,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-23 13:53:57,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-23 13:53:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:57,692 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-23 13:53:57,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:53:57,693 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-23 13:53:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:53:57,696 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:57,696 INFO L357 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-23 13:53:57,696 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:57,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629664, now seen corresponding path program 8 times [2018-07-23 13:53:57,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:53:58,670 WARN L169 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 3 [2018-07-23 13:53:59,036 WARN L169 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 3 [2018-07-23 13:53:59,480 WARN L169 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 3 [2018-07-23 13:53:59,686 WARN L169 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 3 [2018-07-23 13:53:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:59,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:53:59,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:53:59,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:53:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:59,705 INFO L185 omatonBuilderFactory]: Interpolants [384#(<= main_x 10), 385#(<= main_x 12), 386#(<= main_x 14), 387#(<= main_x 16), 377#true, 378#false, 379#(<= main_x 0), 380#(<= main_x 2), 381#(<= main_x 4), 382#(<= main_x 6), 383#(<= main_x 8)] [2018-07-23 13:53:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:53:59,707 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:53:59,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:53:59,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:53:59,708 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-23 13:53:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:53:59,730 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 13:53:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:53:59,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-23 13:53:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:53:59,731 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:53:59,731 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:53:59,731 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:53:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:53:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:53:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:53:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 13:53:59,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-23 13:53:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:53:59,737 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 13:53:59,737 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:53:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 13:53:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:53:59,738 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:53:59,738 INFO L357 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-23 13:53:59,738 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:53:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 373919704, now seen corresponding path program 9 times [2018-07-23 13:53:59,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:53:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:00,321 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 3 [2018-07-23 13:54:02,236 WARN L169 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 300 DAG size of output: 3 [2018-07-23 13:54:03,445 WARN L169 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 339 DAG size of output: 3 [2018-07-23 13:54:04,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:04,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:04,206 WARN L169 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 3 [2018-07-23 13:54:05,004 WARN L169 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 3 [2018-07-23 13:54:05,442 WARN L169 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 3 [2018-07-23 13:54:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:05,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:05,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:54:05,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:05,451 INFO L185 omatonBuilderFactory]: Interpolants [448#(<= main_x 4), 449#(<= main_x 6), 450#(<= main_x 8), 451#(<= main_x 10), 452#(<= main_x 12), 453#(<= main_x 14), 454#(<= main_x 16), 455#(<= main_x 18), 444#true, 445#false, 446#(<= main_x 0), 447#(<= main_x 2)] [2018-07-23 13:54:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:05,451 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:54:05,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:54:05,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:54:05,452 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-23 13:54:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:05,464 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-23 13:54:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:54:05,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-23 13:54:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:05,466 INFO L225 Difference]: With dead ends: 16 [2018-07-23 13:54:05,466 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:54:05,467 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:54:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:54:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:54:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:54:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-23 13:54:05,474 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-23 13:54:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-23 13:54:05,474 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:54:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-23 13:54:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:54:05,475 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:05,475 INFO L357 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-23 13:54:05,475 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:54:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383392, now seen corresponding path program 10 times [2018-07-23 13:54:05,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:06,499 WARN L169 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 3 [2018-07-23 13:54:10,987 WARN L169 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 588 DAG size of output: 3 [2018-07-23 13:54:15,141 WARN L169 SmtUtils]: Spent 3.77 s on a formula simplification. DAG size of input: 675 DAG size of output: 3 [2018-07-23 13:54:16,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:16,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:16,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:17,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:54:18,560 WARN L169 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 729 DAG size of output: 3 [2018-07-23 13:54:21,609 WARN L169 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 715 DAG size of output: 3 [2018-07-23 13:54:23,920 WARN L169 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 735 DAG size of output: 3 [2018-07-23 13:54:24,651 WARN L169 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 3 [2018-07-23 13:54:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:24,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:54:24,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:54:24,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:54:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:24,660 INFO L185 omatonBuilderFactory]: Interpolants [516#true, 517#false, 518#(<= main_x 0), 519#(<= main_x 2), 520#(<= main_x 4), 521#(<= main_x 6), 522#(<= main_x 8), 523#(<= main_x 10), 524#(<= main_x 12), 525#(<= main_x 14), 526#(<= main_x 16), 527#(<= main_x 18), 528#(<= main_x 20)] [2018-07-23 13:54:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:54:24,661 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:54:24,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:54:24,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:54:24,662 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-23 13:54:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:54:24,670 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 13:54:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:54:24,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-23 13:54:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:54:24,671 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:54:24,671 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:54:24,672 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:54:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:54:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:54:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:54:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 13:54:24,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-23 13:54:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:54:24,676 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 13:54:24,676 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:54:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 13:54:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:54:24,677 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:54:24,677 INFO L357 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-23 13:54:24,677 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:54:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171816, now seen corresponding path program 11 times [2018-07-23 13:54:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:54:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:54:27,679 WARN L169 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 521 DAG size of output: 3 [2018-07-23 13:55:10,300 WARN L169 SmtUtils]: Spent 39.70 s on a formula simplification. DAG size of input: 1164 DAG size of output: 3 [2018-07-23 13:55:27,319 WARN L169 SmtUtils]: Spent 15.82 s on a formula simplification. DAG size of input: 1347 DAG size of output: 3 [2018-07-23 13:55:44,015 WARN L169 SmtUtils]: Spent 15.56 s on a formula simplification. DAG size of input: 1481 DAG size of output: 3 [2018-07-23 13:55:56,574 WARN L169 SmtUtils]: Spent 11.57 s on a formula simplification. DAG size of input: 1507 DAG size of output: 3 [2018-07-23 13:55:59,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:56:05,674 WARN L169 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 1666 DAG size of output: 3 [2018-07-23 13:56:06,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-23 13:56:12,104 WARN L169 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 1235 DAG size of output: 3 [2018-07-23 13:56:15,079 WARN L169 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 796 DAG size of output: 3 [2018-07-23 13:56:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:15,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:56:15,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,088 INFO L185 omatonBuilderFactory]: Interpolants [593#true, 594#false, 595#(<= main_x 0), 596#(<= main_x 2), 597#(<= main_x 4), 598#(<= main_x 6), 599#(<= main_x 8), 600#(<= main_x 10), 601#(<= main_x 12), 602#(<= main_x 14), 603#(<= main_x 16), 604#(<= main_x 18), 605#(<= main_x 20), 606#(<= main_x 22)] [2018-07-23 13:56:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:56:15,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:56:15,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:15,090 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-23 13:56:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:15,102 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-23 13:56:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:56:15,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-23 13:56:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:15,103 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:56:15,103 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:56:15,104 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 103.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:56:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:56:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:56:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-23 13:56:15,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-23 13:56:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-23 13:56:15,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:56:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-23 13:56:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:56:15,108 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:15,108 INFO L357 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-23 13:56:15,108 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0AssertViolationASSERT]=== [2018-07-23 13:56:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645664, now seen corresponding path program 12 times [2018-07-23 13:56:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:23,543 WARN L169 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 1029 DAG size of output: 3 [2018-07-23 13:56:31,218 WARN L169 SmtUtils]: Spent 7.18 s on a formula simplification. DAG size of input: 1032 DAG size of output: 3 [2018-07-23 13:56:39,378 WARN L169 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 1033 DAG size of output: 3 Received shutdown request... [2018-07-23 13:58:23,128 WARN L177 SmtUtils]: Removed 2 from assertion stack [2018-07-23 13:58:23,129 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:58:23,133 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:58:23,133 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:58:23 BoogieIcfgContainer [2018-07-23 13:58:23,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:58:23,134 INFO L168 Benchmark]: Toolchain (without parser) took 267618.30 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-23 13:58:23,135 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:58:23,136 INFO L168 Benchmark]: Boogie Preprocessor took 51.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:58:23,136 INFO L168 Benchmark]: RCFGBuilder took 271.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 13:58:23,137 INFO L168 Benchmark]: TraceAbstraction took 267290.15 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-07-23 13:58:23,141 INFO L336 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 271.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267290.15 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 16 with TraceHistMax 12, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 2316. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 267.2s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 2 SDslu, 60 SDs, 0 SdLazy, 150 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/286 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 138.2s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 2274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 0/286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-58-23-153.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-58-23-153.csv Completed graceful shutdown