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-06.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d80e71f [2018-10-13 17:52:18,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-13 17:52:18,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-13 17:52:18,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-13 17:52:18,112 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-13 17:52:18,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-13 17:52:18,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-13 17:52:18,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-13 17:52:18,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-13 17:52:18,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-13 17:52:18,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-13 17:52:18,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-13 17:52:18,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-13 17:52:18,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-13 17:52:18,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-13 17:52:18,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-13 17:52:18,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-13 17:52:18,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-13 17:52:18,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-13 17:52:18,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-13 17:52:18,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-13 17:52:18,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-13 17:52:18,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-13 17:52:18,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-13 17:52:18,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-13 17:52:18,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-13 17:52:18,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-13 17:52:18,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-13 17:52:18,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-13 17:52:18,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-13 17:52:18,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-13 17:52:18,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-13 17:52:18,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-13 17:52:18,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-13 17:52:18,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-13 17:52:18,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-13 17:52:18,142 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:52:18,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-13 17:52:18,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-13 17:52:18,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-13 17:52:18,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-13 17:52:18,154 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-13 17:52:18,155 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-13 17:52:18,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-13 17:52:18,158 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-13 17:52:18,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-13 17:52:18,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-13 17:52:18,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-13 17:52:18,159 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-13 17:52:18,159 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-13 17:52:18,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-13 17:52:18,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-13 17:52:18,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-13 17:52:18,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-13 17:52:18,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-13 17:52:18,251 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-13 17:52:18,252 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-13 17:52:18,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-06.bpl [2018-10-13 17:52:18,253 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc03-06.bpl' [2018-10-13 17:52:18,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-13 17:52:18,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-13 17:52:18,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-13 17:52:18,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-13 17:52:18,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-13 17:52:18,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-13 17:52:18,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-13 17:52:18,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-13 17:52:18,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-13 17:52:18,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (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:52:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-13 17:52:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-13 17:52:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-13 17:52:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-13 17:52:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-13 17:52:18,819 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-13 17:52:18,820 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:18 BoogieIcfgContainer [2018-10-13 17:52:18,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-13 17:52:18,820 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-13 17:52:18,820 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-13 17:52:18,821 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-13 17:52:18,825 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:18" (1/1) ... [2018-10-13 17:52:18,833 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-13 17:52:18,834 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-13 17:52:18,871 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-13 17:52:18,936 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-13 17:52:18,971 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-13 17:52:19,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-13 17:53:33,316 INFO L315 AbstractInterpreter]: Visited 36 different actions 168 times. Merged at 22 different actions 102 times. Never widened. Found 36 fixpoints after 6 different actions. Largest state had 25 variables. [2018-10-13 17:53:33,318 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-13 17:53:33,324 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-13 17:53:34,657 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-13 17:53:34,658 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int] [2018-10-13 17:53:34,658 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-13 17:53:34,658 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 12 [2018-10-13 17:53:34,659 INFO L248 HeapPartitionManager]: # location blocks :6 [2018-10-13 17:53:34,660 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-13 17:53:34,686 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 05:53:34 BasicIcfg [2018-10-13 17:53:34,686 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-13 17:53:34,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-13 17:53:34,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-13 17:53:34,690 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-13 17:53:34,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.10 05:52:18" (1/3) ... [2018-10-13 17:53:34,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25160432 and model type speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:53:34, skipping insertion in model container [2018-10-13 17:53:34,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:52:18" (2/3) ... [2018-10-13 17:53:34,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25160432 and model type speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:53:34, skipping insertion in model container [2018-10-13 17:53:34,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 13.10 05:53:34" (3/3) ... [2018-10-13 17:53:34,694 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-13 17:53:34,705 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-13 17:53:34,711 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-13 17:53:34,724 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-13 17:53:34,747 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-13 17:53:34,748 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-13 17:53:34,748 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-13 17:53:34,748 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-13 17:53:34,749 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-13 17:53:34,749 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-13 17:53:34,749 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-13 17:53:34,749 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-13 17:53:34,749 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-13 17:53:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-13 17:53:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-13 17:53:34,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:34,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:34,771 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:34,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash -491297622, now seen corresponding path program 1 times [2018-10-13 17:53:34,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:35,042 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 17:53:35,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:35,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:35,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:35,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:35,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:35,064 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-10-13 17:53:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:35,294 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2018-10-13 17:53:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:35,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-13 17:53:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:35,312 INFO L225 Difference]: With dead ends: 44 [2018-10-13 17:53:35,313 INFO L226 Difference]: Without dead ends: 38 [2018-10-13 17:53:35,314 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 17:53:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-13 17:53:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-10-13 17:53:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-13 17:53:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-13 17:53:35,351 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 14 [2018-10-13 17:53:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:35,351 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-13 17:53:35,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-13 17:53:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-13 17:53:35,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:35,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:35,352 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:35,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:35,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1949643083, now seen corresponding path program 1 times [2018-10-13 17:53:35,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:35,438 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 17:53:35,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:35,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:35,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:35,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:35,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:35,442 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-13 17:53:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:35,483 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-13 17:53:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:35,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-13 17:53:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:35,485 INFO L225 Difference]: With dead ends: 42 [2018-10-13 17:53:35,485 INFO L226 Difference]: Without dead ends: 42 [2018-10-13 17:53:35,486 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 17:53:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-13 17:53:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-10-13 17:53:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-13 17:53:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 57 transitions. [2018-10-13 17:53:35,491 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 57 transitions. Word has length 15 [2018-10-13 17:53:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:35,491 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 57 transitions. [2018-10-13 17:53:35,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 57 transitions. [2018-10-13 17:53:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-13 17:53:35,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:35,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:35,493 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:35,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 309391463, now seen corresponding path program 1 times [2018-10-13 17:53:35,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:35,594 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 17:53:35,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:35,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:35,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:35,595 INFO L87 Difference]: Start difference. First operand 33 states and 57 transitions. Second operand 4 states. [2018-10-13 17:53:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:35,637 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-13 17:53:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:35,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-13 17:53:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:35,640 INFO L225 Difference]: With dead ends: 43 [2018-10-13 17:53:35,640 INFO L226 Difference]: Without dead ends: 43 [2018-10-13 17:53:35,640 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 17:53:35,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-13 17:53:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-13 17:53:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-13 17:53:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-13 17:53:35,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2018-10-13 17:53:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:35,646 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-13 17:53:35,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-13 17:53:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-13 17:53:35,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:35,647 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:35,647 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:35,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 309393612, now seen corresponding path program 1 times [2018-10-13 17:53:35,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:35,716 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 17:53:35,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:35,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:35,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:35,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:35,718 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-13 17:53:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:35,751 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-13 17:53:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:35,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-10-13 17:53:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:35,753 INFO L225 Difference]: With dead ends: 42 [2018-10-13 17:53:35,753 INFO L226 Difference]: Without dead ends: 42 [2018-10-13 17:53:35,753 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 17:53:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-13 17:53:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-10-13 17:53:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-13 17:53:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2018-10-13 17:53:35,759 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 16 [2018-10-13 17:53:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:35,759 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2018-10-13 17:53:35,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2018-10-13 17:53:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-13 17:53:35,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:35,760 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:35,761 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:35,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:35,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1001201903, now seen corresponding path program 1 times [2018-10-13 17:53:35,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:35,913 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 17:53:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:35,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:35,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:35,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:35,914 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2018-10-13 17:53:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:35,948 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-13 17:53:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:35,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-10-13 17:53:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:35,951 INFO L225 Difference]: With dead ends: 43 [2018-10-13 17:53:35,951 INFO L226 Difference]: Without dead ends: 43 [2018-10-13 17:53:35,952 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 17:53:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-13 17:53:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-13 17:53:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-13 17:53:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-13 17:53:35,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2018-10-13 17:53:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:35,956 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-13 17:53:35,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-13 17:53:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-13 17:53:35,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:35,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-13 17:53:35,958 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:35,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1001267565, now seen corresponding path program 1 times [2018-10-13 17:53:35,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,051 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 17:53:36,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:36,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:36,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:36,053 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-13 17:53:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,114 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-13 17:53:36,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:36,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-13 17:53:36,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,116 INFO L225 Difference]: With dead ends: 42 [2018-10-13 17:53:36,116 INFO L226 Difference]: Without dead ends: 42 [2018-10-13 17:53:36,116 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 17:53:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-13 17:53:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-10-13 17:53:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-13 17:53:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 61 transitions. [2018-10-13 17:53:36,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 61 transitions. Word has length 17 [2018-10-13 17:53:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,121 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 61 transitions. [2018-10-13 17:53:36,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-10-13 17:53:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-13 17:53:36,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,122 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 17:53:36,123 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,123 INFO L82 PathProgramCache]: Analyzing trace with hash 972517895, now seen corresponding path program 1 times [2018-10-13 17:53:36,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,258 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 17:53:36,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:36,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:36,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:36,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:36,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:36,260 INFO L87 Difference]: Start difference. First operand 37 states and 61 transitions. Second operand 4 states. [2018-10-13 17:53:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,280 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-13 17:53:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:36,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-13 17:53:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,283 INFO L225 Difference]: With dead ends: 43 [2018-10-13 17:53:36,283 INFO L226 Difference]: Without dead ends: 43 [2018-10-13 17:53:36,284 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 17:53:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-13 17:53:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-13 17:53:36,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-13 17:53:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-13 17:53:36,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2018-10-13 17:53:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,288 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-13 17:53:36,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-13 17:53:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-13 17:53:36,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,289 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 17:53:36,289 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash 974523630, now seen corresponding path program 1 times [2018-10-13 17:53:36,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,318 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 17:53:36,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:36,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:36,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:36,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:36,319 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-13 17:53:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,332 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-13 17:53:36,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:36,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-10-13 17:53:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,334 INFO L225 Difference]: With dead ends: 42 [2018-10-13 17:53:36,334 INFO L226 Difference]: Without dead ends: 42 [2018-10-13 17:53:36,335 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 17:53:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-13 17:53:36,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-10-13 17:53:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-13 17:53:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2018-10-13 17:53:36,340 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 18 [2018-10-13 17:53:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,341 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2018-10-13 17:53:36,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2018-10-13 17:53:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-13 17:53:36,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,342 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 17:53:36,342 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 84207379, now seen corresponding path program 1 times [2018-10-13 17:53:36,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,425 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 17:53:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:36,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:36,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:36,427 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 4 states. [2018-10-13 17:53:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,463 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2018-10-13 17:53:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:36,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-10-13 17:53:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,468 INFO L225 Difference]: With dead ends: 43 [2018-10-13 17:53:36,468 INFO L226 Difference]: Without dead ends: 43 [2018-10-13 17:53:36,469 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 17:53:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-13 17:53:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-13 17:53:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-13 17:53:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-10-13 17:53:36,471 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 19 [2018-10-13 17:53:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,471 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-10-13 17:53:36,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2018-10-13 17:53:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-13 17:53:36,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,473 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 17:53:36,473 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash 145461647, now seen corresponding path program 1 times [2018-10-13 17:53:36,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,548 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 17:53:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-13 17:53:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-13 17:53:36,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-13 17:53:36,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-13 17:53:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-13 17:53:36,550 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 3 states. [2018-10-13 17:53:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,611 INFO L93 Difference]: Finished difference Result 42 states and 64 transitions. [2018-10-13 17:53:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-13 17:53:36,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-13 17:53:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,613 INFO L225 Difference]: With dead ends: 42 [2018-10-13 17:53:36,613 INFO L226 Difference]: Without dead ends: 37 [2018-10-13 17:53:36,613 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 17:53:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-13 17:53:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-13 17:53:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-13 17:53:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2018-10-13 17:53:36,618 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 19 [2018-10-13 17:53:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,618 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2018-10-13 17:53:36,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-13 17:53:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2018-10-13 17:53:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-13 17:53:36,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,619 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 17:53:36,619 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1655909209, now seen corresponding path program 1 times [2018-10-13 17:53:36,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,656 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 17:53:36,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:36,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:36,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:36,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:36,657 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 4 states. [2018-10-13 17:53:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,683 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2018-10-13 17:53:36,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:36,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-10-13 17:53:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,684 INFO L225 Difference]: With dead ends: 37 [2018-10-13 17:53:36,684 INFO L226 Difference]: Without dead ends: 33 [2018-10-13 17:53:36,684 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 17:53:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-13 17:53:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-10-13 17:53:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-13 17:53:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2018-10-13 17:53:36,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 20 [2018-10-13 17:53:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,687 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2018-10-13 17:53:36,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2018-10-13 17:53:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-13 17:53:36,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-13 17:53:36,688 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 17:53:36,689 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2018-10-13 17:53:36,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-13 17:53:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1093925943, now seen corresponding path program 1 times [2018-10-13 17:53:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-13 17:53:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-13 17:53:36,775 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 17:53:36,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-13 17:53:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-10-13 17:53:36,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-13 17:53:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-13 17:53:36,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-13 17:53:36,776 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 4 states. [2018-10-13 17:53:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-13 17:53:36,789 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2018-10-13 17:53:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-13 17:53:36,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-13 17:53:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-13 17:53:36,790 INFO L225 Difference]: With dead ends: 22 [2018-10-13 17:53:36,790 INFO L226 Difference]: Without dead ends: 0 [2018-10-13 17:53:36,790 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 17:53:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-13 17:53:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-13 17:53:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-13 17:53:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-13 17:53:36,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-10-13 17:53:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-13 17:53:36,792 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-13 17:53:36,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-13 17:53:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-13 17:53:36,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-13 17:53:36,797 INFO L202 PluginConnector]: Adding new model speedup-poc03-06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:53:36 BasicIcfg [2018-10-13 17:53:36,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-13 17:53:36,798 INFO L168 Benchmark]: Toolchain (without parser) took 78480.53 ms. Allocated memory was 1.5 GB in the beginning and 6.3 GB in the end (delta: 4.8 GB). Free memory was 1.4 GB in the beginning and 6.1 GB in the end (delta: -4.7 GB). Peak memory consumption was 84.2 MB. Max. memory is 17.8 GB. [2018-10-13 17:53:36,799 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 17:53:36,799 INFO L168 Benchmark]: Boogie Preprocessor took 53.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 17:53:36,800 INFO L168 Benchmark]: RCFGBuilder took 447.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 17:53:36,801 INFO L168 Benchmark]: IcfgTransformer took 75865.76 ms. Allocated memory was 1.5 GB in the beginning and 5.5 GB in the end (delta: 4.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 17.8 GB. [2018-10-13 17:53:36,802 INFO L168 Benchmark]: TraceAbstraction took 2110.18 ms. Allocated memory was 5.5 GB in the beginning and 6.3 GB in the end (delta: 841.5 MB). Free memory was 2.6 GB in the beginning and 6.1 GB in the end (delta: -3.5 GB). There was no memory consumed. Max. memory is 17.8 GB. [2018-10-13 17:53:36,806 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.4 GB. There was no memory consumed. Max. memory is 17.8 GB. * Boogie Preprocessor took 53.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 17.8 GB. * RCFGBuilder took 447.29 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 75865.76 ms. Allocated memory was 1.5 GB in the beginning and 5.5 GB in the end (delta: 4.0 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 17.8 GB. * TraceAbstraction took 2110.18 ms. Allocated memory was 5.5 GB in the beginning and 6.3 GB in the end (delta: 841.5 MB). Free memory was 2.6 GB in the beginning and 6.1 GB in the end (delta: -3.5 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 : 30 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 18 LocStat_NO_SUPPORTING_EQUALITIES : 429 LocStat_NO_SUPPORTING_DISEQUALITIES : 1602 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 47 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 54157.78 APPLY_RETURN(MILLISECONDS) : 7100.91 #APPLY_NORMAL : 160 #APPLY_RETURN : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 36 different actions 168 times. Merged at 22 different actions 102 times. Never widened. Found 36 fixpoints after 6 different actions. Largest state had 25 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 6 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: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. SAFE Result, 2.0s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 394 SDtfs, 209 SDslu, 399 SDs, 0 SdLazy, 97 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=8, 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, 12 MinimizatonAttempts, 105 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 9354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 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-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-13_17-53-36-823.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-13_17-53-36-823.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/speedup-poc03-06.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-13_17-53-36-823.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...