java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:27,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:27,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:27,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:27,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:27,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:27,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:27,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:27,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:27,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:27,265 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:27,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:27,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:27,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:27,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:27,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:27,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:27,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:27,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:27,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:27,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:27,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:27,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:27,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:27,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:27,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:27,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:27,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:27,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:27,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:27,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:27,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:27,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:27,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:27,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:27,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:27,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:27,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:27,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:27,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:27,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:27,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:27,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:27,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:27,359 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:27,360 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:27,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2019-08-05 10:49:27,361 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl' [2019-08-05 10:49:27,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:27,405 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:27,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:27,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:27,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:27,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:27,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:27,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:27,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:27,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... [2019-08-05 10:49:27,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:27,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:27,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:27,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:27,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:49:27,540 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:49:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:49:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:49:27,831 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:49:27,832 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:27,833 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:27 BoogieIcfgContainer [2019-08-05 10:49:27,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:27,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:27,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:27,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:27,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:27" (1/2) ... [2019-08-05 10:49:27,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2377f2 and model type num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:27, skipping insertion in model container [2019-08-05 10:49:27,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:27" (2/2) ... [2019-08-05 10:49:27,842 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2019-08-05 10:49:27,852 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:27,863 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:27,881 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:27,907 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:27,907 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:27,908 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:27,908 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:27,908 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:27,908 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:27,908 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:27,908 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:27,909 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:27,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:27,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:27,934 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:27,940 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:49:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:28,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:28,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:28,094 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,143 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:28,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,155 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:28,155 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:28,157 INFO L628 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 [2019-08-05 10:49:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:28,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,185 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:28,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:28,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:28,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:49:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:28,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:28,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:28,342 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,372 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:28,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:28,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,373 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:28,373 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:28,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:28,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,378 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:28,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:28,378 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,378 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:28,379 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:49:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:28,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:28,483 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,504 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:28,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,506 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:28,506 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:28,507 INFO L628 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 [2019-08-05 10:49:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:28,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:28,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,513 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:28,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:28,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,514 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:28,514 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:49:28,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:49:28,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:49:28,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:49:28,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:28,672 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:49:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,721 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:49:28,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:49:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,722 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:28,722 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:28,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:28,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,726 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:28,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:49:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:28,727 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,727 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:28,728 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:49:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:49:28,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:49:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:49:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:28,960 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:49:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,980 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:49:28,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:49:28,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:49:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,982 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:28,982 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:49:28,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:49:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:49:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:49:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:49:28,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:49:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,985 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:49:28,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:49:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:49:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:49:28,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,986 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:49:28,987 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:49:28,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:49:29,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:49:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:49:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:29,254 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:49:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,278 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:49:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:49:29,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:49:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,279 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:49:29,279 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:29,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:49:29,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:49:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,283 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:49:29,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:49:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:49:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:49:29,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,284 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:49:29,284 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:49:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:49:29,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:49:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:49:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:29,574 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:49:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,624 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:49:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:49:29,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:49:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,626 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:29,626 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:49:29,627 INFO L628 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 [2019-08-05 10:49:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:49:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:49:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:49:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:49:29,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:49:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,630 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:49:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:49:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:49:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:49:29,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,631 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:49:29,631 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:49:29,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:49:29,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:49:29,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:49:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:29,841 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:49:29,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,883 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:49:29,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:49:29,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:49:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,885 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:49:29,885 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:29,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:49:29,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:49:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,889 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:49:29,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:49:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:49:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:49:29,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,890 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:49:29,890 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:49:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:49:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:49:30,021 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:49:30,066 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:49:30 BoogieIcfgContainer [2019-08-05 10:49:30,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:49:30,072 INFO L168 Benchmark]: Toolchain (without parser) took 2663.89 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 111.3 MB in the beginning and 90.8 MB in the end (delta: 20.5 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:30,073 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:49:30,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.32 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:30,080 INFO L168 Benchmark]: Boogie Preprocessor took 25.52 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.2 MB in the end (delta: 938.5 kB). Peak memory consumption was 938.5 kB. Max. memory is 7.1 GB. [2019-08-05 10:49:30,081 INFO L168 Benchmark]: RCFGBuilder took 361.89 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:30,082 INFO L168 Benchmark]: TraceAbstraction took 2231.83 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 98.6 MB in the beginning and 90.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:30,093 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 133.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.32 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.52 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.2 MB in the end (delta: 938.5 kB). Peak memory consumption was 938.5 kB. Max. memory is 7.1 GB. * RCFGBuilder took 361.89 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2231.83 ms. Allocated memory was 133.7 MB in the beginning and 170.4 MB in the end (delta: 36.7 MB). Free memory was 98.6 MB in the beginning and 90.8 MB in the end (delta: 7.8 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_~bit~5, main_~c~4, main_~x~4, main_~y~4, main_~i~5; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=1, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=2, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=3, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=4, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=5, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=6, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=7, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L28] assume !(main_~c~4 < 8) && main_~c~4 < 256; [L29] assume (((main_~y~4 < 256 && 0 <= main_~y~4) && 0 <= main_~x~4) && main_~x~4 < 256) && !(main_~x~4 == main_~y~4); [L30] __VERIFIER_assert_#in~cond := 0; [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.1s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 21 SDs, 0 SdLazy, 65 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 8 NumberOfNonLiveVariables, 512 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...