java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/cookify/recursive/enc_recursive_broken.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:21:47,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:21:47,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:21:47,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:21:47,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:21:47,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:21:47,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:21:47,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:21:47,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:21:47,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:21:47,874 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:21:47,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:21:47,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:21:47,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:21:47,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:21:47,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:21:47,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:21:47,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:21:47,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:21:47,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:21:47,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:21:47,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:21:47,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:21:47,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:21:47,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:21:47,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:21:47,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:21:47,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:21:47,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:21:47,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:21:47,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:21:47,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:21:47,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:21:47,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:21:47,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:21:47,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:21:47,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:21:47,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:21:47,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:21:47,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:21:47,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:21:47,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:21:47,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:21:47,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:21:47,955 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:21:47,956 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:21:47,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/recursive/enc_recursive_broken.bpl [2019-08-05 11:21:47,957 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/cookify/recursive/enc_recursive_broken.bpl' [2019-08-05 11:21:48,009 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:21:48,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:21:48,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:48,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:21:48,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:21:48,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,053 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:21:48,053 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:21:48,053 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:21:48,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:21:48,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:21:48,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:21:48,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:21:48,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... [2019-08-05 11:21:48,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:21:48,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:21:48,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:21:48,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:21:48,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:21:48,227 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_main_TL given in one single declaration [2019-08-05 11:21:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure enc_main_TL [2019-08-05 11:21:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_main_TL [2019-08-05 11:21:48,228 INFO L124 BoogieDeclarations]: Specification and implementation of procedure preturn_T given in one single declaration [2019-08-05 11:21:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure preturn_T [2019-08-05 11:21:48,229 INFO L138 BoogieDeclarations]: Found implementation of procedure preturn_T [2019-08-05 11:21:48,229 INFO L124 BoogieDeclarations]: Specification and implementation of procedure preturn_TL given in one single declaration [2019-08-05 11:21:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure preturn_TL [2019-08-05 11:21:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure preturn_TL [2019-08-05 11:21:48,230 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_recursive_TL given in one single declaration [2019-08-05 11:21:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure enc_recursive_TL [2019-08-05 11:21:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_recursive_TL [2019-08-05 11:21:48,230 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_havoc_recursive_TL given in one single declaration [2019-08-05 11:21:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure enc_havoc_recursive_TL [2019-08-05 11:21:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_havoc_recursive_TL [2019-08-05 11:21:48,231 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:21:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:21:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:21:48,232 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_recursive_T given in one single declaration [2019-08-05 11:21:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure enc_recursive_T [2019-08-05 11:21:48,232 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_recursive_T [2019-08-05 11:21:48,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_main_T given in one single declaration [2019-08-05 11:21:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure enc_main_T [2019-08-05 11:21:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_main_T [2019-08-05 11:21:48,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_havoc_main_TL given in one single declaration [2019-08-05 11:21:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure enc_havoc_main_TL [2019-08-05 11:21:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_havoc_main_TL [2019-08-05 11:21:48,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_havoc_recursive_T given in one single declaration [2019-08-05 11:21:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure enc_havoc_recursive_T [2019-08-05 11:21:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_havoc_recursive_T [2019-08-05 11:21:48,236 INFO L124 BoogieDeclarations]: Specification and implementation of procedure enc_havoc_main_T given in one single declaration [2019-08-05 11:21:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure enc_havoc_main_T [2019-08-05 11:21:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure enc_havoc_main_T [2019-08-05 11:21:49,533 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:21:49,533 INFO L283 CfgBuilder]: Removed 22 assume(true) statements. [2019-08-05 11:21:49,535 INFO L202 PluginConnector]: Adding new model enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:49 BoogieIcfgContainer [2019-08-05 11:21:49,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:21:49,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:21:49,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:21:49,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:21:49,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:21:48" (1/2) ... [2019-08-05 11:21:49,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a1f827b and model type enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:21:49, skipping insertion in model container [2019-08-05 11:21:49,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:21:49" (2/2) ... [2019-08-05 11:21:49,543 INFO L109 eAbstractionObserver]: Analyzing ICFG enc_recursive_broken.bpl [2019-08-05 11:21:49,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:21:49,563 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:21:49,582 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:21:49,613 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:21:49,614 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:21:49,614 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:21:49,614 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:21:49,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:21:49,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:21:49,615 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:21:49,615 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:21:49,615 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:21:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-08-05 11:21:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:21:49,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:49,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:49,649 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:49,659 INFO L82 PathProgramCache]: Analyzing trace with hash -546881202, now seen corresponding path program 1 times [2019-08-05 11:21:49,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:49,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:49,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:49,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:49,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:49,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:49,859 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 4 states. [2019-08-05 11:21:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:50,060 INFO L93 Difference]: Finished difference Result 80 states and 110 transitions. [2019-08-05 11:21:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:50,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:21:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:50,075 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:21:50,076 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:21:50,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:21:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:21:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:21:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2019-08-05 11:21:50,132 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 8 [2019-08-05 11:21:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:50,133 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 99 transitions. [2019-08-05 11:21:50,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 99 transitions. [2019-08-05 11:21:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:21:50,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:50,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:50,137 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash -60951945, now seen corresponding path program 1 times [2019-08-05 11:21:50,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:50,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:50,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:50,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:50,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:50,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:50,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,261 INFO L87 Difference]: Start difference. First operand 65 states and 99 transitions. Second operand 4 states. [2019-08-05 11:21:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:50,376 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2019-08-05 11:21:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:50,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:21:50,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:50,382 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:21:50,382 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:21:50,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:21:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-08-05 11:21:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:21:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2019-08-05 11:21:50,396 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 100 transitions. Word has length 10 [2019-08-05 11:21:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:50,396 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 100 transitions. [2019-08-05 11:21:50,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2019-08-05 11:21:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:21:50,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:50,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:50,399 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:50,399 INFO L82 PathProgramCache]: Analyzing trace with hash 881263184, now seen corresponding path program 1 times [2019-08-05 11:21:50,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:50,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:50,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:50,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:50,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:50,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:50,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,520 INFO L87 Difference]: Start difference. First operand 66 states and 100 transitions. Second operand 4 states. [2019-08-05 11:21:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:50,735 INFO L93 Difference]: Finished difference Result 70 states and 104 transitions. [2019-08-05 11:21:50,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:50,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-05 11:21:50,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:50,738 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:21:50,738 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:21:50,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:21:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:21:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:21:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2019-08-05 11:21:50,748 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 21 [2019-08-05 11:21:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:50,749 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2019-08-05 11:21:50,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2019-08-05 11:21:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:21:50,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:50,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:50,751 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:50,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1181326018, now seen corresponding path program 1 times [2019-08-05 11:21:50,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:50,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:50,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:50,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:50,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:50,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:50,834 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand 4 states. [2019-08-05 11:21:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,174 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2019-08-05 11:21:51,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:51,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 11:21:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,176 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:21:51,177 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:21:51,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:21:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-08-05 11:21:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:21:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2019-08-05 11:21:51,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 23 [2019-08-05 11:21:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,188 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2019-08-05 11:21:51,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2019-08-05 11:21:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:21:51,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,191 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:51,191 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1609854942, now seen corresponding path program 1 times [2019-08-05 11:21:51,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:51,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:51,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,333 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand 4 states. [2019-08-05 11:21:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,553 INFO L93 Difference]: Finished difference Result 81 states and 121 transitions. [2019-08-05 11:21:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:51,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-08-05 11:21:51,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,555 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:21:51,555 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:21:51,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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 11:21:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:21:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2019-08-05 11:21:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:21:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2019-08-05 11:21:51,566 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 25 [2019-08-05 11:21:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2019-08-05 11:21:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2019-08-05 11:21:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:21:51,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:51,570 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1417009439, now seen corresponding path program 1 times [2019-08-05 11:21:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:51,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:51,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:51,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:51,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:51,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,663 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand 4 states. [2019-08-05 11:21:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,806 INFO L93 Difference]: Finished difference Result 86 states and 129 transitions. [2019-08-05 11:21:51,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:51,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-08-05 11:21:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,810 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:21:51,810 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:21:51,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:21:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2019-08-05 11:21:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:21:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2019-08-05 11:21:51,820 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 26 [2019-08-05 11:21:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,821 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2019-08-05 11:21:51,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2019-08-05 11:21:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:51,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,823 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:51,823 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2035128973, now seen corresponding path program 1 times [2019-08-05 11:21:51,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:51,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:51,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:51,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:51,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,922 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand 4 states. [2019-08-05 11:21:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,996 INFO L93 Difference]: Finished difference Result 85 states and 128 transitions. [2019-08-05 11:21:51,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:51,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-08-05 11:21:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,997 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:21:51,997 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:21:51,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:21:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-08-05 11:21:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:21:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2019-08-05 11:21:52,007 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 28 [2019-08-05 11:21:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:52,007 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2019-08-05 11:21:52,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2019-08-05 11:21:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:52,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:52,010 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 109790269, now seen corresponding path program 1 times [2019-08-05 11:21:52,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:52,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:52,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:52,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:52,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:52,096 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand 4 states. [2019-08-05 11:21:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:52,333 INFO L93 Difference]: Finished difference Result 90 states and 136 transitions. [2019-08-05 11:21:52,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:52,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-08-05 11:21:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:52,335 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:21:52,335 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:21:52,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:21:52,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2019-08-05 11:21:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:21:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2019-08-05 11:21:52,343 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 30 [2019-08-05 11:21:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:52,344 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2019-08-05 11:21:52,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2019-08-05 11:21:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:52,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,345 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:52,345 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1885715555, now seen corresponding path program 1 times [2019-08-05 11:21:52,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:52,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:21:52,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:52,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:52,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:21:52,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:21:52,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:21:52,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:52,404 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand 4 states. [2019-08-05 11:21:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:52,611 INFO L93 Difference]: Finished difference Result 95 states and 144 transitions. [2019-08-05 11:21:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:21:52,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-08-05 11:21:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:52,613 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:21:52,613 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:21:52,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:21:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:21:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2019-08-05 11:21:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:21:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2019-08-05 11:21:52,632 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 31 [2019-08-05 11:21:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:52,632 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2019-08-05 11:21:52,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:21:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2019-08-05 11:21:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:52,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,634 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:52,634 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash 649974897, now seen corresponding path program 1 times [2019-08-05 11:21:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:52,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:21:52,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:21:52,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:21:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:21:52,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:21:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:21:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:21:52,768 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand 7 states. [2019-08-05 11:21:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:52,875 INFO L93 Difference]: Finished difference Result 115 states and 177 transitions. [2019-08-05 11:21:52,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:21:52,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-08-05 11:21:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:52,882 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:21:52,883 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:21:52,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:21:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:21:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-08-05 11:21:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:21:52,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2019-08-05 11:21:52,891 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 31 [2019-08-05 11:21:52,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:52,892 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2019-08-05 11:21:52,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:21:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2019-08-05 11:21:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:52,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:52,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:21:52,894 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:52,894 INFO L82 PathProgramCache]: Analyzing trace with hash 145150363, now seen corresponding path program 1 times [2019-08-05 11:21:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:21:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:21:52,955 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:21:52,990 INFO L202 PluginConnector]: Adding new model enc_recursive_broken.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:52 BoogieIcfgContainer [2019-08-05 11:21:52,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:52,993 INFO L168 Benchmark]: Toolchain (without parser) took 4980.69 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 108.7 MB in the beginning and 92.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:52,994 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:52,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.41 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 105.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:52,996 INFO L168 Benchmark]: Boogie Preprocessor took 64.87 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 104.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:52,998 INFO L168 Benchmark]: RCFGBuilder took 1380.48 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 104.2 MB in the beginning and 136.1 MB in the end (delta: -31.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:52,999 INFO L168 Benchmark]: TraceAbstraction took 3453.53 ms. Allocated memory was 176.7 MB in the beginning and 203.9 MB in the end (delta: 27.3 MB). Free memory was 136.1 MB in the beginning and 92.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:53,004 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 110.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.41 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 105.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.87 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 104.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1380.48 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 104.2 MB in the beginning and 136.1 MB in the end (delta: -31.9 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3453.53 ms. Allocated memory was 176.7 MB in the beginning and 203.9 MB in the end (delta: 27.3 MB). Free memory was 136.1 MB in the beginning and 92.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: assertion can be violated assertion can be violated We found a FailurePath: [L13] havoc foo; [L37] havoc bla; [L38] CALL call ret := enc_main_T(bla, foo, intStack, boolStack, idStack, ppStack, sp, pp); VAL [cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, old(retVal_int)=14, pp=0, retVal_int=14] [L48] bla := cookiefy_args_bla; [L49] intStack := cookiefy_args_intStack; [L50] boolStack := cookiefy_args_boolStack; [L51] idStack := cookiefy_args_idStack; [L52] ppStack := cookiefy_args_ppStack; [L53] sp := cookiefy_args_sp; [L54] foo := cookiefy_args_foo; VAL [bla=15, cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, foo=true, old(retVal_int)=14, pp=0, retVal_int=14, sp=-1] [L55] COND FALSE !(pp == 3) VAL [bla=15, cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, foo=true, old(retVal_int)=14, pp=0, retVal_int=14, sp=-1] [L58] COND FALSE !(pp == 2) [L62] intStack[sp][0] := bla; [L63] ppStack[sp] := 2; [L64] idStack[sp] := 0; VAL [bla=15, cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, foo=true, old(retVal_int)=14, pp=0, retVal_int=14, sp=-1] [L65] CALL call ret := enc_havoc_recursive_T(0, foo, intStack, boolStack, idStack, ppStack, sp + 1, 0); VAL [cookiefy_args_i=0, foo=true, old(retVal_int)=14, pp=0, retVal_int=14, sp=0] [L78] havoc i; [L79] havoc v; [L80] i := cookiefy_args_i; VAL [cookiefy_args_i=0, foo=true, i=0, old(retVal_int)=14, pp=0, retVal_int=14, sp=0] [L81] CALL call ret := enc_recursive_T(i, v, foo, intStack, boolStack, idStack, ppStack, sp, pp); VAL [old(retVal_int)=14, retVal_int=14] [L92] i := cookiefy_args_i; [L93] v := cookiefy_args_v; [L94] intStack := cookiefy_args_intStack; [L95] boolStack := cookiefy_args_boolStack; [L96] idStack := cookiefy_args_idStack; [L97] ppStack := cookiefy_args_ppStack; [L98] sp := cookiefy_args_sp; [L99] foo := cookiefy_args_foo; VAL [old(retVal_int)=14, retVal_int=14] [L100] COND FALSE !(pp == 13) VAL [old(retVal_int)=14, retVal_int=14] [L103] COND FALSE !(pp == 12) VAL [old(retVal_int)=14, retVal_int=14] [L106] COND FALSE !(pp == 11) VAL [old(retVal_int)=14, retVal_int=14] [L109] COND FALSE !(pp == 10) VAL [old(retVal_int)=14, retVal_int=14] [L112] COND FALSE !(pp == 9) VAL [old(retVal_int)=14, retVal_int=14] [L115] COND FALSE !(pp == 8) VAL [old(retVal_int)=14, retVal_int=14] [L118] COND FALSE !(pp == 7) VAL [old(retVal_int)=14, retVal_int=14] [L121] COND FALSE !(pp == 6) VAL [old(retVal_int)=14, retVal_int=14] [L124] COND FALSE !(pp == 5) VAL [old(retVal_int)=14, retVal_int=14] [L127] COND FALSE !(pp == 4) VAL [old(retVal_int)=14, retVal_int=14] [L130] COND FALSE !(pp == 3) VAL [old(retVal_int)=14, retVal_int=14] [L133] COND FALSE !(pp == 2) VAL [old(retVal_int)=14, retVal_int=14] [L273] ret := !foo; [L142] COND TRUE !ret VAL [old(retVal_int)=14, retVal_int=14] [L81] RET call ret := enc_recursive_T(i, v, foo, intStack, boolStack, idStack, ppStack, sp, pp); VAL [cookiefy_args_i=0, foo=true, i=0, old(retVal_int)=14, pp=0, ret=false, retVal_int=14, sp=0, v=16] [L65] RET call ret := enc_havoc_recursive_T(0, foo, intStack, boolStack, idStack, ppStack, sp + 1, 0); VAL [bla=15, cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, foo=true, old(retVal_int)=14, pp=0, ret=false, retVal_int=14, sp=-1] [L67] bla := retVal_int; VAL [bla=14, cookiefy_args_bla=15, cookiefy_args_foo=true, cookiefy_args_sp=-1, foo=true, old(retVal_int)=14, pp=0, ret=false, retVal_int=14, sp=-1] [L38] RET call ret := enc_main_T(bla, foo, intStack, boolStack, idStack, ppStack, sp, pp); VAL [retVal_int=14] [L15] assert CookiefyRet != false; VAL [retVal_int=14] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 78 locations, 1 error locations. UNSAFE Result, 3.3s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1009 SDtfs, 118 SDslu, 2082 SDs, 0 SdLazy, 232 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=10, 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, 10 MinimizatonAttempts, 55 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 7575 SizeOfPredicates, 3 NumberOfNonLiveVariables, 925 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...