java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:24:47,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:24:47,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:24:47,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:24:47,103 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:24:47,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:24:47,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:24:47,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:24:47,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:24:47,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:24:47,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:24:47,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:24:47,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:24:47,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:24:47,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:24:47,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:24:47,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:24:47,122 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:24:47,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:24:47,133 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:24:47,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:24:47,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:24:47,140 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:24:47,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:24:47,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:24:47,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:24:47,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:24:47,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:24:47,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:24:47,148 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:24:47,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:24:47,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:24:47,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:24:47,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:24:47,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:24:47,153 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:24:47,153 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:24:47,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:24:47,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:24:47,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:24:47,180 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:24:47,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:24:47,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:24:47,181 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:24:47,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:24:47,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:24:47,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:24:47,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:24:47,261 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:24:47,261 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:24:47,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl [2018-07-23 15:24:47,262 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/interleave_bits.i_3.bpl' [2018-07-23 15:24:47,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:24:47,322 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:24:47,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:24:47,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:24:47,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:24:47,351 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,353 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,365 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,365 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,373 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,377 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,379 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 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:24:47,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:24:47,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:24:47,389 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:24:47,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:47" (1/1) ... [2018-07-23 15:24:47,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:24:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:24:47,645 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:24:47,646 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:24:47 BoogieIcfgContainer [2018-07-23 15:24:47,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:24:47,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:24:47,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:24:47,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:24:47,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:47" (1/2) ... [2018-07-23 15:24:47,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f3d634 and model type interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:24:47, skipping insertion in model container [2018-07-23 15:24:47,653 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 23.07 03:24:47" (2/2) ... [2018-07-23 15:24:47,655 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i_3.bpl [2018-07-23 15:24:47,666 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:24:47,674 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:24:47,721 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:24:47,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:24:47,722 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:24:47,723 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:24:47,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:24:47,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:24:47,723 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:24:47,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:24:47,724 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:24:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 15:24:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:24:47,744 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:47,745 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:24:47,745 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 15:24:47,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:47,836 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:24:47,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:24:47,841 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:24:47,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:24:47,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:24:47,857 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 15:24:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:47,886 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 15:24:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:24:47,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 15:24:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:47,898 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:24:47,899 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:24:47,902 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:24:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:24:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:24:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:24:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:24:47,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 15:24:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:47,941 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:24:47,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:24:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:24:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:24:47,942 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:47,942 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 15:24:47,943 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:47,943 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 15:24:47,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:47,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:47,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:24:47,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:24:47,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:24:47,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:24:47,995 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 15:24:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,017 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:24:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:24:48,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 15:24:48,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,018 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:24:48,019 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:24:48,020 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:24:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:24:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:24:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:24:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:24:48,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 15:24:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,025 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:24:48,025 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:24:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:24:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:24:48,026 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,026 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 15:24:48,026 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 15:24:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,104 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,104 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:24:48,105 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:24:48,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:24:48,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:24:48,108 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 15:24:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,135 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:24:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:24:48,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 15:24:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,137 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:24:48,137 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:24:48,138 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:24:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:24:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:24:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:24:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:24:48,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 15:24:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,142 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:24:48,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:24:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:24:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:24:48,143 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,144 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 15:24:48,144 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 15:24:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:24:48,225 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:24:48,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:24:48,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:24:48,226 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 15:24:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,259 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:24:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:24:48,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 15:24:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,260 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:24:48,260 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:24:48,261 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:24:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:24:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:24:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:24:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:24:48,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 15:24:48,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,269 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:24:48,269 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:24:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:24:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:24:48,270 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,271 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 15:24:48,271 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 15:24:48,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,376 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:24:48,377 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:24:48,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:24:48,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:24:48,380 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 15:24:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,415 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:24:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:24:48,419 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 15:24:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,420 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:24:48,420 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:24:48,421 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:24:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:24:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:24:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:24:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:24:48,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 15:24:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,432 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:24:48,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:24:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:24:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:24:48,433 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,433 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 15:24:48,436 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-23 15:24:48,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,531 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:24:48,537 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:24:48,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:24:48,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:24:48,538 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 15:24:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,618 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:24:48,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:24:48,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 15:24:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,623 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:24:48,623 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 15:24:48,626 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:24:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 15:24:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 15:24:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:24:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:24:48,637 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 15:24:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,638 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:24:48,638 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:24:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:24:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:24:48,639 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,641 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 15:24:48,641 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-23 15:24:48,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:24:48,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:24:48,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:24:48,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:24:48,733 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 15:24:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,806 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 15:24:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:24:48,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 15:24:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,808 INFO L225 Difference]: With dead ends: 21 [2018-07-23 15:24:48,808 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 15:24:48,809 INFO L573 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 [2018-07-23 15:24:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 15:24:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 15:24:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 15:24:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 15:24:48,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 15:24:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,815 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 15:24:48,816 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:24:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 15:24:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:24:48,817 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,817 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 15:24:48,817 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-23 15:24:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:24:48,872 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:24:48,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:24:48,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:24:48,873 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 15:24:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,910 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:24:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:24:48,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:24:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,911 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:24:48,912 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 15:24:48,912 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:24:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 15:24:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 15:24:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:24:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:24:48,918 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 15:24:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,918 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:24:48,918 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:24:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:24:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:24:48,919 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,920 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 15:24:48,920 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-23 15:24:48,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:48,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:24:48,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:24:48,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:24:48,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:24:48,983 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 15:24:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,044 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 15:24:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:24:49,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 15:24:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,046 INFO L225 Difference]: With dead ends: 25 [2018-07-23 15:24:49,046 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 15:24:49,047 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:24:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 15:24:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 15:24:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:24:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:24:49,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 15:24:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,062 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:24:49,062 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:24:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:24:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:24:49,064 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,065 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 15:24:49,065 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-23 15:24:49,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:24:49,156 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:24:49,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:24:49,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:24:49,163 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 15:24:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,220 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:24:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:24:49,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 15:24:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,222 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:24:49,222 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:24:49,225 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:24:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:24:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:24:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:24:49,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:24:49,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 15:24:49,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,235 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:24:49,236 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:24:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:24:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:24:49,237 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,237 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 15:24:49,239 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-23 15:24:49,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:24:49,325 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:24:49,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:24:49,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:24:49,326 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 15:24:49,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,374 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 15:24:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:24:49,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 15:24:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,376 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:24:49,376 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 15:24:49,376 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:24:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 15:24:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 15:24:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 15:24:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 15:24:49,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 15:24:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,383 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 15:24:49,383 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:24:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 15:24:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:24:49,384 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,384 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 15:24:49,384 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,385 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-23 15:24:49,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:24:49,454 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:24:49,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:24:49,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:24:49,455 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 15:24:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,505 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:24:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:24:49,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 15:24:49,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,506 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:24:49,506 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 15:24:49,507 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:24:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 15:24:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 15:24:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:24:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:24:49,513 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 15:24:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,513 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:24:49,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:24:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:24:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:24:49,515 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,515 INFO L353 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 15:24:49,515 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-23 15:24:49,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:24:49,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:24:49,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:24:49,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:24:49,597 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 15:24:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,665 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 15:24:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:24:49,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 15:24:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,668 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:24:49,668 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 15:24:49,670 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:24:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 15:24:49,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 15:24:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:24:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 15:24:49,681 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 15:24:49,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,681 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 15:24:49,682 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:24:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 15:24:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 15:24:49,683 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,683 INFO L353 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 15:24:49,683 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-23 15:24:49,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:24:49,779 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:24:49,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:24:49,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:24:49,780 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 15:24:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,853 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:24:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:24:49,853 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 15:24:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,854 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:24:49,861 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 15:24:49,862 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:24:49,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 15:24:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 15:24:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:24:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:24:49,874 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 15:24:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,874 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:24:49,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:24:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:24:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:24:49,876 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,876 INFO L353 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 15:24:49,876 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,878 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-23 15:24:49,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:49,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:24:49,966 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:24:49,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:24:49,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:24:49,967 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 15:24:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:50,033 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 15:24:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:24:50,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 15:24:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:50,035 INFO L225 Difference]: With dead ends: 37 [2018-07-23 15:24:50,035 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 15:24:50,036 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:24:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 15:24:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 15:24:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:24:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:24:50,045 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 15:24:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:50,045 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:24:50,045 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:24:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:24:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:24:50,049 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:50,049 INFO L353 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 15:24:50,050 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-23 15:24:50,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:50,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:50,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:24:50,158 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:24:50,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:24:50,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:24:50,159 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 15:24:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:50,245 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:24:50,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:24:50,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 15:24:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:50,249 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:24:50,250 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 15:24:50,252 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:24:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 15:24:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 15:24:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:24:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:24:50,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 15:24:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:50,264 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:24:50,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:24:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:24:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:24:50,265 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:50,266 INFO L353 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 15:24:50,266 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-23 15:24:50,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 15:24:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-23 15:24:50,321 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 15:24:50,359 INFO L202 PluginConnector]: Adding new model interleave_bits.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:24:50 BoogieIcfgContainer [2018-07-23 15:24:50,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:24:50,361 INFO L168 Benchmark]: Toolchain (without parser) took 3039.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 253.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 7.1 GB. [2018-07-23 15:24:50,364 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:24:50,364 INFO L168 Benchmark]: Boogie Preprocessor took 59.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:24:50,365 INFO L168 Benchmark]: RCFGBuilder took 257.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:24:50,367 INFO L168 Benchmark]: TraceAbstraction took 2712.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-07-23 15:24:50,372 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 257.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2712.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 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_~z~5=0] [L32] assume true; VAL [main_~i~5=0, 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] [L32] assume true; VAL [main_~i~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] [L32] assume true; VAL [main_~i~5=2] [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] [L32] assume true; VAL [main_~i~5=3] [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] [L32] assume true; VAL [main_~i~5=4] [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] [L32] assume true; VAL [main_~i~5=5] [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] [L32] assume true; VAL [main_~i~5=6] [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] [L32] assume true; VAL [main_~i~5=7] [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] [L32] assume true; VAL [main_~i~5=8] [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] [L32] assume true; VAL [main_~i~5=9] [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] [L32] assume true; VAL [main_~i~5=10] [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] [L32] assume true; VAL [main_~i~5=11] [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] [L32] assume true; VAL [main_~i~5=12] [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] [L32] assume true; VAL [main_~i~5=13] [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] [L32] assume true; VAL [main_~i~5=14] [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] [L32] assume true; VAL [main_~i~5=15] [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] [L32] assume true; VAL [main_~i~5=16] [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_~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_~zz~5=0, main_~z~5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.6s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 0 SDslu, 1497 SDs, 0 SdLazy, 1768 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 44080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1360 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 Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-24-50-390.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/interleave_bits.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-24-50-390.csv Received shutdown request...