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/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:10,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:10,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:10,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:10,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:10,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:10,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:10,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:10,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:10,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:10,404 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:10,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:10,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:10,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:10,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:10,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:10,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:10,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:10,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:10,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:10,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:10,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:10,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:10,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:10,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:10,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:10,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:10,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:10,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:10,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:10,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:10,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:10,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:10,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:10,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:10,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:10,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:10,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:10,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:10,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:10,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:10,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:10,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:10,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:10,480 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:10,481 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:10,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2019-08-05 10:15:10,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2019-08-05 10:15:10,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:10,542 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:10,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:10,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:10,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:10,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:10,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:10,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:10,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:10,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/1) ... [2019-08-05 10:15:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:10,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:10,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:10,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:10,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (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:15:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:10,869 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:10,870 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:15:10,871 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:10 BoogieIcfgContainer [2019-08-05 10:15:10,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:10,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:10,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:10,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:10,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:10" (1/2) ... [2019-08-05 10:15:10,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b61901 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:10, skipping insertion in model container [2019-08-05 10:15:10,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:10" (2/2) ... [2019-08-05 10:15:10,879 INFO L109 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2019-08-05 10:15:10,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:10,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:10,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:10,939 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:10,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:10,940 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:10,941 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:10,941 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:10,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:10,941 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:10,941 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:10,942 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:15:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:15:10,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:10,964 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:15:10,967 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:10,973 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:15:11,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,123 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:15:11,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:11,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:11,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:11,149 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:15:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,175 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:15:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:11,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:15:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,188 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:15:11,188 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:15:11,190 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:15:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:15:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:15:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:15:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:15:11,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:15:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,226 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:15:11,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:15:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:15:11,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,227 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:15:11,228 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:15:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,411 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:15:11,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:15:11,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:11,415 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:15:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,532 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:15:11,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:11,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:15:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,536 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:15:11,536 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:15:11,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:15:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:15:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:15:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:15:11,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:15:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,543 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:15:11,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:15:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:15:11,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,545 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:15:11,549 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,550 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:15:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,724 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:15:11,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:11,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:11,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:11,731 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:15:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:11,784 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:15:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:11,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:15:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:11,785 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:15:11,786 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:15:11,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:15:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:15:11,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:15:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:15:11,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:15:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:11,789 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:15:11,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:15:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:15:11,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:11,791 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:15:11,791 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:15:11,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:11,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:15:11,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:11,945 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:15:11,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:11,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:11,947 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:15:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,017 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:15:12,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:12,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:15:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,029 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:15:12,029 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:15:12,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:15:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:15:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:15:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:15:12,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:15:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,035 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:15:12,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:15:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:15:12,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,037 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:15:12,037 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:15:12,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:12,293 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:15:12,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:12,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:12,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:12,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:12,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:12,295 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:15:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,387 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:15:12,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:12,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:15:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,389 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:15:12,389 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:15:12,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:15:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:15:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:15:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:15:12,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:15:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,393 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:15:12,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:15:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:15:12,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,393 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:15:12,394 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,394 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:15:12,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:12,574 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:15:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:12,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:12,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:12,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:12,576 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:15:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,741 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:15:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:12,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:15:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,743 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:15:12,743 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:15:12,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:15:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:15:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:15:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:15:12,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:15:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,747 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:15:12,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:15:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:15:12,748 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,748 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:15:12,749 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:15:12,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:12,863 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:15:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:12,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:12,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:12,866 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:15:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:12,953 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:15:12,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:12,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:15:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:12,956 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:15:12,956 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:15:12,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:15:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:15:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:15:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:15:12,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:15:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:12,959 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:15:12,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:15:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:15:12,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:12,960 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:15:12,960 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:15:12,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:12,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:15:12,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:13,421 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:15:13,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:13,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:13,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:13,423 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:15:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:13,550 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:15:13,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:15:13,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:15:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:13,552 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:15:13,552 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:15:13,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:15:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:15:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:15:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:15:13,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:15:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:13,556 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:15:13,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:15:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:15:13,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:13,557 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:15:13,557 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:13,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:15:13,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:13,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:15:13,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:13,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:13,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:15:13,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:15:13,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:15:13,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:13,738 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:15:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:13,843 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:15:13,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:15:13,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:15:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:13,844 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:15:13,844 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:15:13,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:15:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:15:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:15:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:15:13,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:15:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:13,849 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:15:13,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:15:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:15:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:15:13,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:13,850 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:15:13,850 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:15:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:13,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:15:13,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:14,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:15:14,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:15:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:15:14,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:14,036 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:15:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:14,213 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:15:14,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:15:14,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:15:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:14,214 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:15:14,214 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:15:14,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:15:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:15:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:15:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:15:14,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:15:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:14,218 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:15:14,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:15:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:15:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:15:14,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:14,218 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:15:14,218 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:15:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:14,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:15:14,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:15:14,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:15:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:15:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:14,495 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:15:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:14,653 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:15:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:15:14,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:15:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:14,654 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:15:14,654 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:15:14,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:15:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:15:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:15:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:15:14,657 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:15:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:14,657 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:15:14,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:15:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:15:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:15:14,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:14,658 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:15:14,658 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:15:14,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:14,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:15:14,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:14,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:14,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:15:14,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:15:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:15:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:14,887 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:15:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,030 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:15:15,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:15:15,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:15:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,031 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:15:15,031 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:15:15,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:15:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:15:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:15:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:15:15,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:15:15,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,035 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:15:15,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:15:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:15:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:15:15,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,036 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:15:15,037 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:15:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:15,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:15,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:15:15,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:15:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:15:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:15,293 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:15:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,474 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:15:15,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:15,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:15:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,483 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:15:15,483 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:15:15,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:15:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:15:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:15:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:15:15,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:15:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,488 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:15:15,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:15:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:15:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:15,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,489 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:15:15,489 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:15:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:15,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:15:15,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:15:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:15:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:15,736 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:15:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:15,929 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:15:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:15:15,930 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:15:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:15,931 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:15:15,931 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:15:15,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:15:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:15:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:15:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:15:15,936 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:15:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:15,936 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:15:15,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:15:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:15:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:15:15,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:15,937 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:15:15,937 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:15:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:15,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:15:15,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:15:16,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:15:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:15:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:16,121 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:15:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:16,328 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:15:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:15:16,328 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:15:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:16,329 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:15:16,330 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:15:16,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:15:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:15:16,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:15:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:15:16,333 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:15:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:16,334 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:15:16,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:15:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:15:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:15:16,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:16,335 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:15:16,335 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:15:16,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:16,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:15:16,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:16,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:15:16,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:15:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:15:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:16,928 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:15:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:17,313 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:15:17,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:15:17,314 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:15:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:17,315 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:15:17,315 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:15:17,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:15:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:15:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:15:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:15:17,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:15:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:17,320 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:15:17,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:15:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:15:17,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:15:17,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:17,321 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:15:17,321 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:17,321 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:15:17,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:15:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:15:17,374 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:15:17,398 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:17 BoogieIcfgContainer [2019-08-05 10:15:17,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:17,400 INFO L168 Benchmark]: Toolchain (without parser) took 6859.81 ms. Allocated memory was 132.1 MB in the beginning and 243.3 MB in the end (delta: 111.1 MB). Free memory was 109.3 MB in the beginning and 88.8 MB in the end (delta: 20.5 MB). Peak memory consumption was 131.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:17,401 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 110.8 MB in the beginning and 110.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:15:17,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 132.1 MB. Free memory was 109.3 MB in the beginning and 107.6 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:15:17,403 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 132.1 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:17,406 INFO L168 Benchmark]: RCFGBuilder took 252.16 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 96.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:17,407 INFO L168 Benchmark]: TraceAbstraction took 6525.44 ms. Allocated memory was 132.1 MB in the beginning and 243.3 MB in the end (delta: 111.1 MB). Free memory was 96.2 MB in the beginning and 88.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:17,416 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.22 ms. Allocated memory is still 132.1 MB. Free memory was 110.8 MB in the beginning and 110.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 132.1 MB. Free memory was 109.3 MB in the beginning and 107.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 132.1 MB. Free memory was 107.6 MB in the beginning and 106.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 252.16 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 96.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6525.44 ms. Allocated memory was 132.1 MB in the beginning and 243.3 MB in the end (delta: 111.1 MB). Free memory was 96.2 MB in the beginning and 88.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of bitwiseOr at line 48, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L19] havoc main_#res; [L20] havoc main_#t~nondet0, main_#t~nondet1, main_~x~5, main_~y~5, main_~xx~5, main_~yy~5, main_~zz~5, main_~z~5, main_~i~5; [L21] main_~x~5 := main_#t~nondet0; [L22] havoc main_#t~nondet0; [L23] main_~y~5 := main_#t~nondet1; [L24] havoc main_#t~nondet1; [L25] havoc main_~xx~5; [L26] havoc main_~yy~5; [L27] havoc main_~zz~5; [L28] main_~z~5 := 0; [L29] main_~i~5 := 0; VAL [main_~i~5=0, main_~x~5=2, main_~y~5=1, main_~z~5=0] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=1, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=2, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=3, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=4, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=5, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=6, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=7, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=8, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=9, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=10, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=11, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=12, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=13, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=14, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=15, main_~x~5=2, main_~y~5=1] [L56] assume !!(main_~i~5 % 4294967296 < 16); [L57] main_~z~5 := ~bitwiseOr(main_~z~5, ~bitwiseOr(~shiftLeft(~bitwiseAnd(main_~x~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5), ~shiftLeft(~bitwiseAnd(main_~y~5 % 65536, ~shiftLeft(1, main_~i~5)), main_~i~5 + 1))); [L58] main_~i~5 := main_~i~5 + 1; VAL [main_~i~5=16, main_~x~5=2, main_~y~5=1] [L37] assume !(main_~i~5 % 4294967296 < 16); [L38] main_~xx~5 := main_~x~5 % 65536; [L39] main_~yy~5 := main_~y~5 % 65536; [L40] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 8)), 16711935); [L41] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 4)), 252645135); [L42] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 2)), 858993459); [L43] main_~xx~5 := ~bitwiseAnd(~bitwiseOr(main_~xx~5, ~shiftLeft(main_~xx~5, 1)), 1431655765); [L44] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 8)), 16711935); [L45] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 4)), 252645135); [L46] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 2)), 858993459); [L47] main_~yy~5 := ~bitwiseAnd(~bitwiseOr(main_~yy~5, ~shiftLeft(main_~yy~5, 1)), 1431655765); [L48] main_~zz~5 := ~bitwiseOr(main_~xx~5, ~shiftLeft(main_~yy~5, 1)); [L49] __VERIFIER_assert_#in~cond := (if main_~z~5 % 4294967296 == main_~zz~5 % 4294967296 then 1 else 0); [L50] havoc __VERIFIER_assert_~cond; [L51] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L52] assume __VERIFIER_assert_~cond == 0; [L53] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=2, main_~y~5=1, main_~zz~5=0, main_~z~5=1] [L61] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~5=16, main_~x~5=2, main_~y~5=1, main_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 0 SDslu, 136 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=16, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 16 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...