java -Xmx20000000000 -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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc03-08.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d80e71f [2018-10-13 17:53:39,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-13 17:53:39,267 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-13 17:53:39,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-13 17:53:39,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-13 17:53:39,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-13 17:53:39,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-13 17:53:39,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-13 17:53:39,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-13 17:53:39,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-13 17:53:39,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-13 17:53:39,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-13 17:53:39,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-13 17:53:39,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-13 17:53:39,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-13 17:53:39,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-13 17:53:39,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-13 17:53:39,298 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-13 17:53:39,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-13 17:53:39,301 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-13 17:53:39,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-13 17:53:39,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-13 17:53:39,305 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-13 17:53:39,305 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-13 17:53:39,305 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-13 17:53:39,306 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-13 17:53:39,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-13 17:53:39,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-13 17:53:39,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-13 17:53:39,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-13 17:53:39,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-13 17:53:39,310 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-13 17:53:39,310 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-13 17:53:39,310 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-13 17:53:39,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-13 17:53:39,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-13 17:53:39,312 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-13 17:53:39,324 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-13 17:53:39,324 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-13 17:53:39,325 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-13 17:53:39,325 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-13 17:53:39,325 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-13 17:53:39,325 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-13 17:53:39,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-13 17:53:39,326 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-13 17:53:39,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-13 17:53:39,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-13 17:53:39,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-13 17:53:39,327 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-13 17:53:39,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-13 17:53:39,328 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-13 17:53:39,328 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-13 17:53:39,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-13 17:53:39,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-13 17:53:39,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-13 17:53:39,385 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-13 17:53:39,385 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-13 17:53:39,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-08.bpl [2018-10-13 17:53:39,386 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-08.bpl' [2018-10-13 17:53:39,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-13 17:53:39,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-13 17:53:39,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-13 17:53:39,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-13 17:53:39,439 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-13 17:53:39,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/1) ... [2018-10-13 17:53:39,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-13 17:53:39,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-13 17:53:39,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-13 17:53:39,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-13 17:53:39,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (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-13 17:53:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-13 17:53:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-13 17:53:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-13 17:53:39,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-13 17:53:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-13 17:53:40,144 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-13 17:53:40,144 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:53:40 BoogieIcfgContainer [2018-10-13 17:53:40,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-13 17:53:40,145 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-13 17:53:40,145 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-13 17:53:40,146 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-13 17:53:40,150 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:53:40" (1/1) ... [2018-10-13 17:53:40,158 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-13 17:53:40,158 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-13 17:53:40,201 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-13 17:53:40,248 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-13 17:53:40,268 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-13 17:53:40,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-13 18:02:18,649 INFO L315 AbstractInterpreter]: Visited 46 different actions 270 times. Merged at 28 different actions 168 times. Never widened. Found 64 fixpoints after 8 different actions. Largest state had 31 variables. [2018-10-13 18:02:18,651 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-13 18:02:18,656 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-13 18:02:21,687 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-13 18:02:21,687 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-13 18:02:21,689 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-13 18:02:21,689 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 16 [2018-10-13 18:02:21,689 INFO L248 HeapPartitionManager]: # location blocks :8 [2018-10-13 18:02:21,691 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-13 18:02:21,731 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 06:02:21 BasicIcfg [2018-10-13 18:02:21,731 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-13 18:02:21,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-13 18:02:21,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-13 18:02:21,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-13 18:02:21,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:53:39" (1/3) ... [2018-10-13 18:02:21,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde235b and model type speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:02:21, skipping insertion in model container [2018-10-13 18:02:21,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:53:40" (2/3) ... [2018-10-13 18:02:21,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde235b and model type speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:02:21, skipping insertion in model container [2018-10-13 18:02:21,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 06:02:21" (3/3) ... [2018-10-13 18:02:21,743 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-13 18:02:21,755 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-13 18:02:21,763 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-10-13 18:02:21,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-10-13 18:02:21,804 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-13 18:02:21,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-13 18:02:21,805 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-13 18:02:21,805 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-13 18:02:21,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-13 18:02:21,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-13 18:02:21,806 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-13 18:02:21,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-13 18:02:21,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-13 18:02:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-13 18:02:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-13 18:02:21,827 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:21,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 18:02:21,830 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:21,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1677019180, now seen corresponding path program 1 times [2018-10-13 18:02:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:22,048 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-13 18:02:22,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:22,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:22,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,137 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-10-13 18:02:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:22,206 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-10-13 18:02:22,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:22,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-13 18:02:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:22,220 INFO L225 Difference]: With dead ends: 56 [2018-10-13 18:02:22,220 INFO L226 Difference]: Without dead ends: 50 [2018-10-13 18:02:22,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-13 18:02:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-10-13 18:02:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:22,256 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 18 [2018-10-13 18:02:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:22,257 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:22,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-13 18:02:22,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:22,258 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 18:02:22,259 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:22,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:22,259 INFO L82 PathProgramCache]: Analyzing trace with hash 447987251, now seen corresponding path program 1 times [2018-10-13 18:02:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:22,354 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-13 18:02:22,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:22,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:22,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,357 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:22,407 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:22,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-13 18:02:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:22,409 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:22,410 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:22,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-10-13 18:02:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-13 18:02:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2018-10-13 18:02:22,416 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 19 [2018-10-13 18:02:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:22,417 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2018-10-13 18:02:22,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2018-10-13 18:02:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-13 18:02:22,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:22,418 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] [2018-10-13 18:02:22,419 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:22,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:22,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1002700905, now seen corresponding path program 1 times [2018-10-13 18:02:22,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:22,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:22,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:22,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:22,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:22,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:22,495 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 4 states. [2018-10-13 18:02:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:22,578 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:22,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-13 18:02:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:22,581 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:22,581 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:22,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:22,587 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 20 [2018-10-13 18:02:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:22,588 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:22,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-13 18:02:22,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:22,589 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] [2018-10-13 18:02:22,590 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:22,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1002703118, now seen corresponding path program 1 times [2018-10-13 18:02:22,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:22,650 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-13 18:02:22,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:22,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:22,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,652 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:22,693 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:22,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:22,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-13 18:02:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:22,695 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:22,695 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:22,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2018-10-13 18:02:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-13 18:02:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-10-13 18:02:22,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 20 [2018-10-13 18:02:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:22,703 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2018-10-13 18:02:22,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2018-10-13 18:02:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-13 18:02:22,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:22,704 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] [2018-10-13 18:02:22,706 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:22,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1018958167, now seen corresponding path program 1 times [2018-10-13 18:02:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:22,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:22,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:22,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:22,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:22,797 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand 4 states. [2018-10-13 18:02:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:22,908 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:22,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:22,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-13 18:02:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:22,910 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:22,910 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:22,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:22,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 21 [2018-10-13 18:02:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:22,915 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:22,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-13 18:02:22,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:22,917 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] [2018-10-13 18:02:22,917 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:22,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1019025813, now seen corresponding path program 1 times [2018-10-13 18:02:22,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,004 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-13 18:02:23,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:23,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:23,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:23,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:23,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,006 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,056 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:23,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-13 18:02:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,059 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:23,059 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:23,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-10-13 18:02:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-13 18:02:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2018-10-13 18:02:23,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 21 [2018-10-13 18:02:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,064 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2018-10-13 18:02:23,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2018-10-13 18:02:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-13 18:02:23,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,065 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] [2018-10-13 18:02:23,065 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1522962121, now seen corresponding path program 1 times [2018-10-13 18:02:23,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:23,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:23,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:23,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:23,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:23,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,152 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand 4 states. [2018-10-13 18:02:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,186 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:23,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:23,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-10-13 18:02:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,189 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:23,189 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:23,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:23,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 22 [2018-10-13 18:02:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,194 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:23,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-13 18:02:23,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,196 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] [2018-10-13 18:02:23,197 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1525029360, now seen corresponding path program 1 times [2018-10-13 18:02:23,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,240 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-13 18:02:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:23,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:23,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,241 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,264 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:23,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-13 18:02:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,265 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:23,265 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:23,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-13 18:02:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-13 18:02:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2018-10-13 18:02:23,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 22 [2018-10-13 18:02:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,270 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2018-10-13 18:02:23,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2018-10-13 18:02:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-13 18:02:23,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,272 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] [2018-10-13 18:02:23,272 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,273 INFO L82 PathProgramCache]: Analyzing trace with hash -31890757, now seen corresponding path program 1 times [2018-10-13 18:02:23,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:23,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:23,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:23,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:23,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,349 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand 4 states. [2018-10-13 18:02:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,376 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:23,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-10-13 18:02:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,377 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:23,377 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:23,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:23,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 23 [2018-10-13 18:02:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,383 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:23,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:23,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-13 18:02:23,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,384 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] [2018-10-13 18:02:23,384 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash 31270135, now seen corresponding path program 1 times [2018-10-13 18:02:23,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,457 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-13 18:02:23,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:23,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:23,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,458 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,551 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:23,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-13 18:02:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,552 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:23,552 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:23,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2018-10-13 18:02:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-13 18:02:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 81 transitions. [2018-10-13 18:02:23,561 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 81 transitions. Word has length 23 [2018-10-13 18:02:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,564 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 81 transitions. [2018-10-13 18:02:23,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2018-10-13 18:02:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-13 18:02:23,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,565 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] [2018-10-13 18:02:23,566 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,568 INFO L82 PathProgramCache]: Analyzing trace with hash -959984087, now seen corresponding path program 1 times [2018-10-13 18:02:23,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:23,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:23,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:23,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,724 INFO L87 Difference]: Start difference. First operand 49 states and 81 transitions. Second operand 4 states. [2018-10-13 18:02:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,769 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:23,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-13 18:02:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,771 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:23,771 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:23,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:23,775 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 24 [2018-10-13 18:02:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,775 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:23,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-13 18:02:23,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,777 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] [2018-10-13 18:02:23,777 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,777 INFO L82 PathProgramCache]: Analyzing trace with hash 969374418, now seen corresponding path program 1 times [2018-10-13 18:02:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,816 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-13 18:02:23,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:23,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:23,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,818 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,831 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:23,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:23,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-13 18:02:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,832 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:23,832 INFO L226 Difference]: Without dead ends: 54 [2018-10-13 18:02:23,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-13 18:02:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-13 18:02:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-13 18:02:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2018-10-13 18:02:23,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 24 [2018-10-13 18:02:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,837 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2018-10-13 18:02:23,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2018-10-13 18:02:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-13 18:02:23,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,838 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] [2018-10-13 18:02:23,839 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1192768287, now seen corresponding path program 1 times [2018-10-13 18:02:23,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:23,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:23,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:23,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:23,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:23,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,884 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand 4 states. [2018-10-13 18:02:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:23,921 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2018-10-13 18:02:23,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:23,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-10-13 18:02:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:23,923 INFO L225 Difference]: With dead ends: 55 [2018-10-13 18:02:23,923 INFO L226 Difference]: Without dead ends: 55 [2018-10-13 18:02:23,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-13 18:02:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2018-10-13 18:02:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 18:02:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2018-10-13 18:02:23,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 25 [2018-10-13 18:02:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:23,929 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-10-13 18:02:23,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2018-10-13 18:02:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-13 18:02:23,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:23,930 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] [2018-10-13 18:02:23,931 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:23,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -14163879, now seen corresponding path program 1 times [2018-10-13 18:02:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:23,959 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-13 18:02:23,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 18:02:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 18:02:23,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 18:02:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 18:02:23,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:23,960 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2018-10-13 18:02:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:24,008 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-10-13 18:02:24,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 18:02:24,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-13 18:02:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:24,009 INFO L225 Difference]: With dead ends: 54 [2018-10-13 18:02:24,009 INFO L226 Difference]: Without dead ends: 47 [2018-10-13 18:02:24,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 18:02:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-13 18:02:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-13 18:02:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-13 18:02:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2018-10-13 18:02:24,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 25 [2018-10-13 18:02:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:24,012 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2018-10-13 18:02:24,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 18:02:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2018-10-13 18:02:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-13 18:02:24,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:24,014 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] [2018-10-13 18:02:24,015 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:24,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 63921801, now seen corresponding path program 1 times [2018-10-13 18:02:24,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:24,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:24,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:24,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:24,092 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 4 states. [2018-10-13 18:02:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:24,109 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2018-10-13 18:02:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:24,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-10-13 18:02:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:24,111 INFO L225 Difference]: With dead ends: 47 [2018-10-13 18:02:24,111 INFO L226 Difference]: Without dead ends: 41 [2018-10-13 18:02:24,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-13 18:02:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-10-13 18:02:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-13 18:02:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-10-13 18:02:24,118 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 26 [2018-10-13 18:02:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:24,118 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-10-13 18:02:24,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2018-10-13 18:02:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-13 18:02:24,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 18:02:24,121 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] [2018-10-13 18:02:24,122 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 18:02:24,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 18:02:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 174121603, now seen corresponding path program 1 times [2018-10-13 18:02:24,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 18:02:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 18:02:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-13 18:02:24,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 18:02:24,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 18:02:24,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 18:02:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 18:02:24,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:24,278 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 4 states. [2018-10-13 18:02:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 18:02:24,293 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2018-10-13 18:02:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 18:02:24,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-10-13 18:02:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 18:02:24,293 INFO L225 Difference]: With dead ends: 28 [2018-10-13 18:02:24,294 INFO L226 Difference]: Without dead ends: 0 [2018-10-13 18:02:24,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 18:02:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-13 18:02:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-13 18:02:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-13 18:02:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-13 18:02:24,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-10-13 18:02:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 18:02:24,296 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-13 18:02:24,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 18:02:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-13 18:02:24,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-13 18:02:24,300 INFO L202 PluginConnector]: Adding new model speedup-poc03-08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:02:24 BasicIcfg [2018-10-13 18:02:24,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-13 18:02:24,301 INFO L168 Benchmark]: Toolchain (without parser) took 524864.19 ms. Allocated memory was 1.5 GB in the beginning and 7.8 GB in the end (delta: 6.2 GB). Free memory was 1.5 GB in the beginning and 7.6 GB in the end (delta: -6.1 GB). Peak memory consumption was 119.5 MB. Max. memory is 17.8 GB. [2018-10-13 18:02:24,303 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 18:02:24,303 INFO L168 Benchmark]: Boogie Preprocessor took 47.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 18:02:24,304 INFO L168 Benchmark]: RCFGBuilder took 658.03 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 17.8 GB. [2018-10-13 18:02:24,305 INFO L168 Benchmark]: IcfgTransformer took 521586.52 ms. Allocated memory was 1.5 GB in the beginning and 7.5 GB in the end (delta: 6.0 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.7 GB. Max. memory is 17.8 GB. [2018-10-13 18:02:24,306 INFO L168 Benchmark]: TraceAbstraction took 2568.20 ms. Allocated memory was 7.5 GB in the beginning and 7.8 GB in the end (delta: 265.3 MB). Free memory was 3.7 GB in the beginning and 7.6 GB in the end (delta: -3.8 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 18:02:24,310 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.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * Boogie Preprocessor took 47.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 658.03 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 17.8 GB. * IcfgTransformer took 521586.52 ms. Allocated memory was 1.5 GB in the beginning and 7.5 GB in the end (delta: 6.0 GB). Free memory was 1.4 GB in the beginning and 3.7 GB in the end (delta: -2.3 GB). Peak memory consumption was 3.7 GB. Max. memory is 17.8 GB. * TraceAbstraction took 2568.20 ms. Allocated memory was 7.5 GB in the beginning and 7.8 GB in the end (delta: 265.3 MB). Free memory was 3.7 GB in the beginning and 7.6 GB in the end (delta: -3.8 GB). There was no memory consumed. Max. memory is 17.8 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 38 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 24 LocStat_NO_SUPPORTING_EQUALITIES : 731 LocStat_NO_SUPPORTING_DISEQUALITIES : 3692 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 48 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 61 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 449648.98 APPLY_RETURN(MILLISECONDS) : 28311.44 #APPLY_NORMAL : 260 #APPLY_RETURN : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 46 different actions 270 times. Merged at 28 different actions 168 times. Never widened. Found 64 fixpoints after 8 different actions. Largest state had 31 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 8 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : null COUNT_ARRAY_READS for [#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 56]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 62]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 61]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 63]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 59]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 58]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 8 error locations. SAFE Result, 2.5s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 382 SDslu, 730 SDs, 0 SdLazy, 131 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 189 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 20904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 0/8 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/speedup-poc03-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-13_18-02-24-331.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-13_18-02-24-331.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-08.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-13_18-02-24-331.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...