java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:08:31,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:08:31,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:08:31,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:08:31,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:08:31,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:08:31,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:08:31,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:08:31,837 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:08:31,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:08:31,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:08:31,839 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:08:31,840 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:08:31,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:08:31,842 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:08:31,843 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:08:31,844 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:08:31,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:08:31,848 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:08:31,850 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:08:31,851 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:08:31,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:08:31,858 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:08:31,858 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:08:31,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:08:31,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:08:31,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:08:31,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:08:31,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:08:31,870 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:08:31,870 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:08:31,871 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:08:31,871 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:08:31,872 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:08:31,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:08:31,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:08:31,876 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:08:31,897 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:08:31,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:08:31,898 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:08:31,898 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:08:31,898 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:08:31,899 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:08:31,900 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:08:31,900 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:08:31,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:08:31,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:08:31,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:08:31,901 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:08:31,901 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:08:31,903 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:08:31,903 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:08:31,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:08:31,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:08:31,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:08:31,993 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:08:31,993 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:08:31,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-15 15:08:31,994 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2018-10-15 15:08:32,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:08:32,100 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:08:32,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:08:32,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:08:32,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:08:32,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/1) ... [2018-10-15 15:08:32,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:08:32,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:08:32,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:08:32,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:08:32,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (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 [2018-10-15 15:08:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:08:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:08:33,481 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:08:33,482 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:33 BoogieIcfgContainer [2018-10-15 15:08:33,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:08:33,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:08:33,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:08:33,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:08:33,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:08:32" (1/2) ... [2018-10-15 15:08:33,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58239286 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:08:33, skipping insertion in model container [2018-10-15 15:08:33,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:08:33" (2/2) ... [2018-10-15 15:08:33,490 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2018-10-15 15:08:33,500 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:08:33,508 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:08:33,525 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:08:33,554 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:08:33,555 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:08:33,555 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:08:33,555 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:08:33,555 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:08:33,555 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:08:33,556 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:08:33,556 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:08:33,556 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:08:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states. [2018-10-15 15:08:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 15:08:33,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:33,605 INFO L375 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:33,606 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:33,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1773359410, now seen corresponding path program 1 times [2018-10-15 15:08:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:08:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:33,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:33,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:33,995 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 3 states. [2018-10-15 15:08:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:34,320 INFO L93 Difference]: Finished difference Result 271 states and 282 transitions. [2018-10-15 15:08:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:34,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-15 15:08:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:34,350 INFO L225 Difference]: With dead ends: 271 [2018-10-15 15:08:34,351 INFO L226 Difference]: Without dead ends: 271 [2018-10-15 15:08:34,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-15 15:08:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-15 15:08:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 15:08:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 282 transitions. [2018-10-15 15:08:34,442 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 282 transitions. Word has length 151 [2018-10-15 15:08:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:34,443 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 282 transitions. [2018-10-15 15:08:34,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 282 transitions. [2018-10-15 15:08:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 15:08:34,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:34,449 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2018-10-15 15:08:34,449 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:34,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash 522496490, now seen corresponding path program 1 times [2018-10-15 15:08:34,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:08:34,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:34,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:34,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:34,639 INFO L87 Difference]: Start difference. First operand 271 states and 282 transitions. Second operand 3 states. [2018-10-15 15:08:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:35,108 INFO L93 Difference]: Finished difference Result 282 states and 293 transitions. [2018-10-15 15:08:35,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:35,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-10-15 15:08:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:35,113 INFO L225 Difference]: With dead ends: 282 [2018-10-15 15:08:35,113 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 15:08:35,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 15:08:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-10-15 15:08:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 15:08:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 293 transitions. [2018-10-15 15:08:35,136 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 293 transitions. Word has length 170 [2018-10-15 15:08:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:35,136 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 293 transitions. [2018-10-15 15:08:35,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 293 transitions. [2018-10-15 15:08:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:08:35,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:35,141 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:35,142 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:35,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2088384083, now seen corresponding path program 1 times [2018-10-15 15:08:35,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-15 15:08:35,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:35,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:35,335 INFO L87 Difference]: Start difference. First operand 282 states and 293 transitions. Second operand 3 states. [2018-10-15 15:08:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:35,512 INFO L93 Difference]: Finished difference Result 295 states and 306 transitions. [2018-10-15 15:08:35,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:35,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-15 15:08:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:35,516 INFO L225 Difference]: With dead ends: 295 [2018-10-15 15:08:35,517 INFO L226 Difference]: Without dead ends: 295 [2018-10-15 15:08:35,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-15 15:08:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-15 15:08:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 15:08:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 306 transitions. [2018-10-15 15:08:35,530 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 306 transitions. Word has length 192 [2018-10-15 15:08:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:35,531 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 306 transitions. [2018-10-15 15:08:35,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 306 transitions. [2018-10-15 15:08:35,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 15:08:35,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:35,536 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:35,536 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1713054788, now seen corresponding path program 1 times [2018-10-15 15:08:35,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-15 15:08:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:35,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:35,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:35,703 INFO L87 Difference]: Start difference. First operand 295 states and 306 transitions. Second operand 3 states. [2018-10-15 15:08:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:35,770 INFO L93 Difference]: Finished difference Result 425 states and 445 transitions. [2018-10-15 15:08:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:35,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2018-10-15 15:08:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:35,774 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:08:35,774 INFO L226 Difference]: Without dead ends: 420 [2018-10-15 15:08:35,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-10-15 15:08:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 386. [2018-10-15 15:08:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 15:08:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 406 transitions. [2018-10-15 15:08:35,789 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 406 transitions. Word has length 215 [2018-10-15 15:08:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:35,790 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 406 transitions. [2018-10-15 15:08:35,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 406 transitions. [2018-10-15 15:08:35,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 15:08:35,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:35,795 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 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, 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, 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, 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, 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] [2018-10-15 15:08:35,795 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:35,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1752899422, now seen corresponding path program 1 times [2018-10-15 15:08:35,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-15 15:08:36,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:36,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:36,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:36,005 INFO L87 Difference]: Start difference. First operand 386 states and 406 transitions. Second operand 3 states. [2018-10-15 15:08:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:36,209 INFO L93 Difference]: Finished difference Result 403 states and 423 transitions. [2018-10-15 15:08:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:36,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-15 15:08:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:36,213 INFO L225 Difference]: With dead ends: 403 [2018-10-15 15:08:36,213 INFO L226 Difference]: Without dead ends: 403 [2018-10-15 15:08:36,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-15 15:08:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-15 15:08:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 15:08:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 423 transitions. [2018-10-15 15:08:36,225 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 423 transitions. Word has length 239 [2018-10-15 15:08:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:36,226 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 423 transitions. [2018-10-15 15:08:36,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 423 transitions. [2018-10-15 15:08:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 15:08:36,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:36,230 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1] [2018-10-15 15:08:36,231 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:36,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 707842239, now seen corresponding path program 1 times [2018-10-15 15:08:36,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 15:08:36,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:36,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:36,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:36,432 INFO L87 Difference]: Start difference. First operand 403 states and 423 transitions. Second operand 3 states. [2018-10-15 15:08:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:36,630 INFO L93 Difference]: Finished difference Result 528 states and 559 transitions. [2018-10-15 15:08:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:36,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-10-15 15:08:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:36,633 INFO L225 Difference]: With dead ends: 528 [2018-10-15 15:08:36,634 INFO L226 Difference]: Without dead ends: 528 [2018-10-15 15:08:36,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-15 15:08:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 485. [2018-10-15 15:08:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 15:08:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 515 transitions. [2018-10-15 15:08:36,646 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 515 transitions. Word has length 265 [2018-10-15 15:08:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:36,646 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 515 transitions. [2018-10-15 15:08:36,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 515 transitions. [2018-10-15 15:08:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 15:08:36,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:36,651 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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] [2018-10-15 15:08:36,651 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:36,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -248073360, now seen corresponding path program 1 times [2018-10-15 15:08:36,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-10-15 15:08:36,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:36,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:36,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:36,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:36,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:36,792 INFO L87 Difference]: Start difference. First operand 485 states and 515 transitions. Second operand 3 states. [2018-10-15 15:08:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:37,119 INFO L93 Difference]: Finished difference Result 596 states and 641 transitions. [2018-10-15 15:08:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:37,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-10-15 15:08:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:37,124 INFO L225 Difference]: With dead ends: 596 [2018-10-15 15:08:37,124 INFO L226 Difference]: Without dead ends: 584 [2018-10-15 15:08:37,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-10-15 15:08:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2018-10-15 15:08:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-10-15 15:08:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 629 transitions. [2018-10-15 15:08:37,136 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 629 transitions. Word has length 289 [2018-10-15 15:08:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:37,137 INFO L481 AbstractCegarLoop]: Abstraction has 584 states and 629 transitions. [2018-10-15 15:08:37,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 629 transitions. [2018-10-15 15:08:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 15:08:37,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:37,140 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:37,140 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:37,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1819352713, now seen corresponding path program 1 times [2018-10-15 15:08:37,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-15 15:08:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:37,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:37,299 INFO L87 Difference]: Start difference. First operand 584 states and 629 transitions. Second operand 3 states. [2018-10-15 15:08:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:37,483 INFO L93 Difference]: Finished difference Result 603 states and 648 transitions. [2018-10-15 15:08:37,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:37,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2018-10-15 15:08:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:37,488 INFO L225 Difference]: With dead ends: 603 [2018-10-15 15:08:37,488 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 15:08:37,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 15:08:37,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-10-15 15:08:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 15:08:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 648 transitions. [2018-10-15 15:08:37,502 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 648 transitions. Word has length 331 [2018-10-15 15:08:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:37,503 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 648 transitions. [2018-10-15 15:08:37,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 648 transitions. [2018-10-15 15:08:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-15 15:08:37,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:37,506 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:37,506 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:37,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1536854582, now seen corresponding path program 1 times [2018-10-15 15:08:37,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2018-10-15 15:08:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:37,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:37,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:37,684 INFO L87 Difference]: Start difference. First operand 603 states and 648 transitions. Second operand 3 states. [2018-10-15 15:08:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:38,599 INFO L93 Difference]: Finished difference Result 666 states and 711 transitions. [2018-10-15 15:08:38,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:38,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2018-10-15 15:08:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:38,605 INFO L225 Difference]: With dead ends: 666 [2018-10-15 15:08:38,605 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 15:08:38,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 15:08:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2018-10-15 15:08:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-15 15:08:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 711 transitions. [2018-10-15 15:08:38,623 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 711 transitions. Word has length 357 [2018-10-15 15:08:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:38,624 INFO L481 AbstractCegarLoop]: Abstraction has 666 states and 711 transitions. [2018-10-15 15:08:38,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 711 transitions. [2018-10-15 15:08:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-15 15:08:38,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:38,635 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:38,635 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:38,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1398588534, now seen corresponding path program 1 times [2018-10-15 15:08:38,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:38,902 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-10-15 15:08:38,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:38,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:38,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:38,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:38,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:38,904 INFO L87 Difference]: Start difference. First operand 666 states and 711 transitions. Second operand 3 states. [2018-10-15 15:08:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:39,653 INFO L93 Difference]: Finished difference Result 747 states and 792 transitions. [2018-10-15 15:08:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:39,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 385 [2018-10-15 15:08:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:39,657 INFO L225 Difference]: With dead ends: 747 [2018-10-15 15:08:39,657 INFO L226 Difference]: Without dead ends: 747 [2018-10-15 15:08:39,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-10-15 15:08:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2018-10-15 15:08:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-10-15 15:08:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 792 transitions. [2018-10-15 15:08:39,670 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 792 transitions. Word has length 385 [2018-10-15 15:08:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:39,671 INFO L481 AbstractCegarLoop]: Abstraction has 747 states and 792 transitions. [2018-10-15 15:08:39,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 792 transitions. [2018-10-15 15:08:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-15 15:08:39,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:39,674 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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] [2018-10-15 15:08:39,675 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:39,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1300107270, now seen corresponding path program 1 times [2018-10-15 15:08:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-15 15:08:39,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:39,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:39,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:39,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:39,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:39,882 INFO L87 Difference]: Start difference. First operand 747 states and 792 transitions. Second operand 3 states. [2018-10-15 15:08:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:40,445 INFO L93 Difference]: Finished difference Result 840 states and 885 transitions. [2018-10-15 15:08:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:40,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2018-10-15 15:08:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:40,453 INFO L225 Difference]: With dead ends: 840 [2018-10-15 15:08:40,453 INFO L226 Difference]: Without dead ends: 840 [2018-10-15 15:08:40,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2018-10-15 15:08:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2018-10-15 15:08:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-10-15 15:08:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 885 transitions. [2018-10-15 15:08:40,469 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 885 transitions. Word has length 421 [2018-10-15 15:08:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:40,469 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 885 transitions. [2018-10-15 15:08:40,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 885 transitions. [2018-10-15 15:08:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 15:08:40,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:40,473 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2018-10-15 15:08:40,474 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:40,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:40,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1978804031, now seen corresponding path program 1 times [2018-10-15 15:08:40,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-15 15:08:40,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:08:40,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:08:40,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:08:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:08:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:08:40,707 INFO L87 Difference]: Start difference. First operand 840 states and 885 transitions. Second operand 3 states. [2018-10-15 15:08:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:41,241 INFO L93 Difference]: Finished difference Result 951 states and 996 transitions. [2018-10-15 15:08:41,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:08:41,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 463 [2018-10-15 15:08:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:41,247 INFO L225 Difference]: With dead ends: 951 [2018-10-15 15:08:41,247 INFO L226 Difference]: Without dead ends: 951 [2018-10-15 15:08:41,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-15 15:08:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-10-15 15:08:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 939. [2018-10-15 15:08:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-10-15 15:08:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 984 transitions. [2018-10-15 15:08:41,266 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 984 transitions. Word has length 463 [2018-10-15 15:08:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:41,267 INFO L481 AbstractCegarLoop]: Abstraction has 939 states and 984 transitions. [2018-10-15 15:08:41,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:08:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 984 transitions. [2018-10-15 15:08:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-15 15:08:41,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:08:41,273 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:08:41,273 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:08:41,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:08:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash 701623202, now seen corresponding path program 1 times [2018-10-15 15:08:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:08:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:08:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 510 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-15 15:08:41,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:08:41,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:08:41,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:08:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:08:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:08:41,717 INFO L87 Difference]: Start difference. First operand 939 states and 984 transitions. Second operand 4 states. [2018-10-15 15:08:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:08:42,547 INFO L93 Difference]: Finished difference Result 1198 states and 1236 transitions. [2018-10-15 15:08:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:08:42,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2018-10-15 15:08:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:08:42,549 INFO L225 Difference]: With dead ends: 1198 [2018-10-15 15:08:42,549 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:08:42,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:08:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:08:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:08:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:08:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:08:42,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 502 [2018-10-15 15:08:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:08:42,551 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:08:42,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:08:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:08:42,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:08:42,557 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:08:42 BoogieIcfgContainer [2018-10-15 15:08:42,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:08:42,558 INFO L168 Benchmark]: Toolchain (without parser) took 10459.95 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 396.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -181.7 MB). Peak memory consumption was 215.2 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:42,561 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-10-15 15:08:42,561 INFO L168 Benchmark]: Boogie Preprocessor took 97.02 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-10-15 15:08:42,562 INFO L168 Benchmark]: RCFGBuilder took 1284.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:42,563 INFO L168 Benchmark]: TraceAbstraction took 9074.57 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 396.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -232.5 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. [2018-10-15 15:08:42,566 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.22 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 97.02 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 1284.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9074.57 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 396.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -232.5 MB). Peak memory consumption was 164.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 269 locations, 1 error locations. SAFE Result, 9.0s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3756 SDtfs, 553 SDslu, 3070 SDs, 0 SdLazy, 935 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=939occurred in iteration=12, 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 89 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3980 NumberOfCodeBlocks, 3980 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3967 ConstructedInterpolants, 0 QuantifiedInterpolants, 1573475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 4614/4627 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-08-42-577.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-08-42-577.csv Received shutdown request...