java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:38:27,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:38:27,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:38:27,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:38:27,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:38:27,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:38:27,802 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:38:27,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:38:27,806 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:38:27,807 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:38:27,808 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:38:27,808 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:38:27,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:38:27,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:38:27,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:38:27,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:38:27,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:38:27,815 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:38:27,817 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:38:27,819 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:38:27,820 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:38:27,821 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:38:27,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:38:27,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:38:27,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:38:27,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:38:27,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:38:27,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:38:27,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:38:27,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:38:27,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:38:27,830 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:38:27,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:38:27,831 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:38:27,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:38:27,832 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:38:27,833 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-10 16:38:27,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:38:27,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:38:27,849 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:38:27,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:38:27,850 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:38:27,850 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:38:27,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:38:27,851 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:38:27,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:38:27,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:38:27,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:38:27,852 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:38:27,852 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:38:27,853 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:38:27,853 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:38:27,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:38:27,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:38:27,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:38:27,952 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:38:27,953 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:38:27,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 16:38:27,954 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memset2_true-valid-memsafety_true-termination.c_4.bpl' [2018-10-10 16:38:28,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:38:28,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:38:28,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:38:28,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:38:28,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:38:28,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:38:28,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:38:28,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:38:28,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:38:28,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (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-10 16:38:28,145 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:38:28,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:38:28,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:38:28,588 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:38:28,589 INFO L202 PluginConnector]: Adding new model memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:28 BoogieIcfgContainer [2018-10-10 16:38:28,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:38:28,590 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:38:28,590 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:38:28,591 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:38:28,595 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:28" (1/1) ... [2018-10-10 16:38:28,604 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:38:28,604 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [] [2018-10-10 16:38:28,638 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:38:28,682 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:38:28,700 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:38:28,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:38:29,753 INFO L315 AbstractInterpreter]: Visited 39 different actions 65 times. Merged at 14 different actions 24 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-10-10 16:38:29,758 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:38:29,765 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:38:29,767 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:38:29,769 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:38:29,782 INFO L202 PluginConnector]: Adding new model memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:38:29 BasicIcfg [2018-10-10 16:38:29,782 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:38:29,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:38:29,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:38:29,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:38:29,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:38:28" (1/3) ... [2018-10-10 16:38:29,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43556528 and model type memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:38:29, skipping insertion in model container [2018-10-10 16:38:29,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:38:28" (2/3) ... [2018-10-10 16:38:29,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43556528 and model type memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:38:29, skipping insertion in model container [2018-10-10 16:38:29,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:38:29" (3/3) ... [2018-10-10 16:38:29,793 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:38:29,805 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:38:29,816 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:38:29,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:38:29,861 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:38:29,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:38:29,863 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:38:29,863 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:38:29,863 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:38:29,863 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:38:29,863 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:38:29,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:38:29,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:38:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-10 16:38:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-10 16:38:29,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:29,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:29,891 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:29,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -359928372, now seen corresponding path program 1 times [2018-10-10 16:38:29,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:30,152 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-10 16:38:30,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:38:30,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 16:38:30,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 16:38:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 16:38:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:38:30,176 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-10-10 16:38:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:30,281 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-10 16:38:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 16:38:30,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-10-10 16:38:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:30,293 INFO L225 Difference]: With dead ends: 39 [2018-10-10 16:38:30,293 INFO L226 Difference]: Without dead ends: 39 [2018-10-10 16:38:30,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:38:30,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-10 16:38:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-10 16:38:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-10 16:38:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-10 16:38:30,404 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-10-10 16:38:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:30,405 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-10 16:38:30,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 16:38:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-10 16:38:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 16:38:30,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:30,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:30,407 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:30,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash 399980494, now seen corresponding path program 1 times [2018-10-10 16:38:30,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:30,530 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-10 16:38:30,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:30,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:38:30,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:38:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:38:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:38:30,534 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 5 states. [2018-10-10 16:38:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:30,699 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-10 16:38:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 16:38:30,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-10 16:38:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:30,701 INFO L225 Difference]: With dead ends: 41 [2018-10-10 16:38:30,701 INFO L226 Difference]: Without dead ends: 41 [2018-10-10 16:38:30,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:38:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-10 16:38:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-10 16:38:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 16:38:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 16:38:30,707 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-10-10 16:38:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:30,707 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 16:38:30,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:38:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 16:38:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 16:38:30,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:30,709 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:30,709 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:30,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 527960400, now seen corresponding path program 2 times [2018-10-10 16:38:30,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:30,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:30,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 16:38:30,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:38:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:38:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:38:30,911 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 6 states. [2018-10-10 16:38:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:31,146 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-10 16:38:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:38:31,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-10 16:38:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:31,151 INFO L225 Difference]: With dead ends: 43 [2018-10-10 16:38:31,151 INFO L226 Difference]: Without dead ends: 43 [2018-10-10 16:38:31,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:38:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-10 16:38:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-10 16:38:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-10 16:38:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-10 16:38:31,156 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-10-10 16:38:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:31,157 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-10 16:38:31,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:38:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-10 16:38:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 16:38:31,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:31,159 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:31,159 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:31,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1037401518, now seen corresponding path program 3 times [2018-10-10 16:38:31,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:31,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:38:31,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:38:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:38:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:38:31,372 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 7 states. [2018-10-10 16:38:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:31,491 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 16:38:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 16:38:31,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 16:38:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:31,493 INFO L225 Difference]: With dead ends: 45 [2018-10-10 16:38:31,493 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 16:38:31,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:38:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 16:38:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-10 16:38:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-10 16:38:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-10 16:38:31,499 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-10-10 16:38:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:31,500 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-10 16:38:31,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:38:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-10 16:38:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 16:38:31,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:31,501 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:31,502 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:31,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2111651116, now seen corresponding path program 4 times [2018-10-10 16:38:31,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:31,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:31,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:38:31,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:38:31,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:38:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:38:31,644 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 8 states. [2018-10-10 16:38:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:32,176 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-10 16:38:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:38:32,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-10-10 16:38:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:32,181 INFO L225 Difference]: With dead ends: 47 [2018-10-10 16:38:32,181 INFO L226 Difference]: Without dead ends: 47 [2018-10-10 16:38:32,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:38:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-10 16:38:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-10 16:38:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 16:38:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 16:38:32,188 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-10-10 16:38:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:32,188 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 16:38:32,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:38:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 16:38:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 16:38:32,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:32,190 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:32,190 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 621603542, now seen corresponding path program 5 times [2018-10-10 16:38:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:38:32,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:38:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:38:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:38:32,354 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 9 states. [2018-10-10 16:38:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:32,531 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-10 16:38:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:38:32,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-10 16:38:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:32,537 INFO L225 Difference]: With dead ends: 49 [2018-10-10 16:38:32,537 INFO L226 Difference]: Without dead ends: 49 [2018-10-10 16:38:32,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:38:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-10 16:38:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-10 16:38:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 16:38:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-10 16:38:32,543 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-10-10 16:38:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:32,543 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-10 16:38:32,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:38:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-10 16:38:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 16:38:32,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:32,545 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:32,545 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:32,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1240655272, now seen corresponding path program 6 times [2018-10-10 16:38:32,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:32,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:32,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:38:32,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:38:32,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:38:32,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:38:32,803 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 10 states. [2018-10-10 16:38:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:32,965 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 16:38:32,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:38:32,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-10-10 16:38:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:32,967 INFO L225 Difference]: With dead ends: 51 [2018-10-10 16:38:32,968 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 16:38:32,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:38:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 16:38:32,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-10 16:38:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-10 16:38:32,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-10 16:38:32,973 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-10-10 16:38:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:32,973 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-10 16:38:32,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:38:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-10 16:38:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 16:38:32,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:32,975 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:32,975 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:32,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash 129986906, now seen corresponding path program 7 times [2018-10-10 16:38:32,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:33,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:38:33,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:38:33,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:38:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:38:33,302 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 11 states. [2018-10-10 16:38:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:33,461 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-10 16:38:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:38:33,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-10-10 16:38:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:33,462 INFO L225 Difference]: With dead ends: 53 [2018-10-10 16:38:33,462 INFO L226 Difference]: Without dead ends: 53 [2018-10-10 16:38:33,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:38:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-10 16:38:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-10 16:38:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 16:38:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 16:38:33,467 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-10-10 16:38:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:33,468 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 16:38:33,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:38:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 16:38:33,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 16:38:33,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:33,469 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:33,469 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:33,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1237839908, now seen corresponding path program 8 times [2018-10-10 16:38:33,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:33,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:33,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:38:33,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:38:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:38:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:38:33,614 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-10-10 16:38:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:33,778 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 16:38:33,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:38:33,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-10 16:38:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:33,779 INFO L225 Difference]: With dead ends: 55 [2018-10-10 16:38:33,779 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 16:38:33,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:38:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 16:38:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-10 16:38:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-10 16:38:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-10 16:38:33,783 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-10-10 16:38:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:33,784 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-10 16:38:33,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:38:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-10 16:38:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 16:38:33,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:33,785 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:33,785 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:33,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:33,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1459415586, now seen corresponding path program 9 times [2018-10-10 16:38:33,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:33,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:33,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:38:33,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:38:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:38:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:38:33,966 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 13 states. [2018-10-10 16:38:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:34,168 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 16:38:34,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:38:34,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-10 16:38:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:34,170 INFO L225 Difference]: With dead ends: 57 [2018-10-10 16:38:34,170 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 16:38:34,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:38:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 16:38:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-10 16:38:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 16:38:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 16:38:34,175 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-10-10 16:38:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:34,175 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 16:38:34,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:38:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 16:38:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 16:38:34,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:34,177 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:34,177 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 354722656, now seen corresponding path program 10 times [2018-10-10 16:38:34,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:34,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:34,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:38:34,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:38:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:38:34,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:38:34,390 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2018-10-10 16:38:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:34,640 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-10 16:38:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:38:34,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-10-10 16:38:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:34,645 INFO L225 Difference]: With dead ends: 59 [2018-10-10 16:38:34,645 INFO L226 Difference]: Without dead ends: 59 [2018-10-10 16:38:34,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:38:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-10 16:38:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-10 16:38:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 16:38:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 16:38:34,650 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-10-10 16:38:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:34,651 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 16:38:34,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:38:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 16:38:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 16:38:34,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:34,653 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:34,653 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:34,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash -15148958, now seen corresponding path program 11 times [2018-10-10 16:38:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:38:34,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:38:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:38:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:38:34,876 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 15 states. [2018-10-10 16:38:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:35,289 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 16:38:35,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:38:35,290 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-10-10 16:38:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:35,290 INFO L225 Difference]: With dead ends: 61 [2018-10-10 16:38:35,291 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 16:38:35,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:38:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 16:38:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-10 16:38:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-10 16:38:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-10 16:38:35,294 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-10-10 16:38:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:35,295 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-10 16:38:35,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:38:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-10 16:38:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 16:38:35,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:35,296 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:35,297 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:35,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1020515556, now seen corresponding path program 12 times [2018-10-10 16:38:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:35,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:38:35,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:38:35,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:38:35,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:38:35,600 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 16 states. [2018-10-10 16:38:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:36,055 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 16:38:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:38:36,062 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-10 16:38:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:36,063 INFO L225 Difference]: With dead ends: 63 [2018-10-10 16:38:36,063 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 16:38:36,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:38:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 16:38:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-10 16:38:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 16:38:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 16:38:36,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-10-10 16:38:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:36,068 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 16:38:36,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:38:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 16:38:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 16:38:36,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:36,070 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:36,070 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:36,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash -138299162, now seen corresponding path program 13 times [2018-10-10 16:38:36,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:36,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:36,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:38:36,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:38:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:38:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:38:36,401 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 17 states. [2018-10-10 16:38:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:36,739 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 16:38:36,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:38:36,739 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-10 16:38:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:36,740 INFO L225 Difference]: With dead ends: 65 [2018-10-10 16:38:36,740 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 16:38:36,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:38:36,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 16:38:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-10 16:38:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 16:38:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 16:38:36,745 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-10-10 16:38:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:36,745 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 16:38:36,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:38:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 16:38:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 16:38:36,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:36,746 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:36,746 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:36,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1362713496, now seen corresponding path program 14 times [2018-10-10 16:38:36,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:37,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:38:37,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:38:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:38:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:38:37,193 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 18 states. [2018-10-10 16:38:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:37,526 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 16:38:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:38:37,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-10-10 16:38:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:37,531 INFO L225 Difference]: With dead ends: 67 [2018-10-10 16:38:37,531 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 16:38:37,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:38:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 16:38:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-10 16:38:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 16:38:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 16:38:37,536 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-10-10 16:38:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:37,536 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 16:38:37,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:38:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 16:38:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 16:38:37,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:37,538 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:37,538 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:37,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1203849366, now seen corresponding path program 15 times [2018-10-10 16:38:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:38,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:38,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:38:38,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:38:38,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:38:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:38:38,616 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 19 states. [2018-10-10 16:38:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:39,188 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-10 16:38:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:38:39,190 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-10-10 16:38:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:39,191 INFO L225 Difference]: With dead ends: 69 [2018-10-10 16:38:39,192 INFO L226 Difference]: Without dead ends: 69 [2018-10-10 16:38:39,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:38:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-10 16:38:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-10 16:38:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 16:38:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 16:38:39,196 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-10-10 16:38:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:39,196 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 16:38:39,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:38:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 16:38:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 16:38:39,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:39,198 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:39,198 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:39,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1140724204, now seen corresponding path program 16 times [2018-10-10 16:38:39,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:39,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:39,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:38:39,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:38:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:38:39,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:38:39,492 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 20 states. [2018-10-10 16:38:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:39,843 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 16:38:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 16:38:39,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-10-10 16:38:39,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:39,844 INFO L225 Difference]: With dead ends: 71 [2018-10-10 16:38:39,845 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 16:38:39,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:38:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 16:38:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-10 16:38:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-10 16:38:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-10 16:38:39,848 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-10-10 16:38:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:39,848 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-10 16:38:39,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:38:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-10 16:38:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 16:38:39,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:39,850 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:39,850 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:39,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -581905426, now seen corresponding path program 17 times [2018-10-10 16:38:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:40,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:40,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:38:40,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:38:40,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:38:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:38:40,119 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 21 states. [2018-10-10 16:38:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:40,565 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 16:38:40,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:38:40,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-10-10 16:38:40,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:40,567 INFO L225 Difference]: With dead ends: 73 [2018-10-10 16:38:40,567 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 16:38:40,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:38:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 16:38:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-10 16:38:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 16:38:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 16:38:40,571 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-10-10 16:38:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:40,571 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 16:38:40,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:38:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 16:38:40,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 16:38:40,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:40,573 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:40,573 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:40,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:40,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1828396400, now seen corresponding path program 18 times [2018-10-10 16:38:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:41,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:38:41,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:38:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:38:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:38:41,271 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 22 states. [2018-10-10 16:38:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:41,680 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-10 16:38:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:38:41,681 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-10-10 16:38:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:41,681 INFO L225 Difference]: With dead ends: 75 [2018-10-10 16:38:41,682 INFO L226 Difference]: Without dead ends: 75 [2018-10-10 16:38:41,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:38:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-10 16:38:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-10 16:38:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 16:38:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 16:38:41,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-10-10 16:38:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:41,685 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 16:38:41,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:38:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 16:38:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 16:38:41,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:41,687 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:41,689 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:41,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1153888654, now seen corresponding path program 19 times [2018-10-10 16:38:41,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:42,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:42,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:38:42,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:38:42,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:38:42,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:38:42,401 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 23 states. [2018-10-10 16:38:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:42,833 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 16:38:42,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:38:42,834 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-10 16:38:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:42,835 INFO L225 Difference]: With dead ends: 77 [2018-10-10 16:38:42,835 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 16:38:42,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:38:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 16:38:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-10 16:38:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-10 16:38:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-10 16:38:42,840 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-10-10 16:38:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:42,840 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-10 16:38:42,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:38:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-10 16:38:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 16:38:42,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:42,841 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:42,842 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:42,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1908328180, now seen corresponding path program 20 times [2018-10-10 16:38:42,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:43,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:38:43,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:38:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:38:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:38:43,479 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-10 16:38:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:43,942 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 16:38:43,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:38:43,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-10 16:38:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:43,943 INFO L225 Difference]: With dead ends: 79 [2018-10-10 16:38:43,944 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 16:38:43,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:38:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 16:38:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-10 16:38:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 16:38:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 16:38:43,947 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-10-10 16:38:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:43,948 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 16:38:43,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:38:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 16:38:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 16:38:43,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:43,949 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:43,949 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:43,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1648859402, now seen corresponding path program 21 times [2018-10-10 16:38:43,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:44,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:38:44,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:38:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:38:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:38:44,954 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-10-10 16:38:45,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:45,434 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-10 16:38:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:38:45,439 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-10-10 16:38:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:45,440 INFO L225 Difference]: With dead ends: 81 [2018-10-10 16:38:45,440 INFO L226 Difference]: Without dead ends: 81 [2018-10-10 16:38:45,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:38:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-10 16:38:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-10 16:38:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 16:38:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 16:38:45,443 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-10-10 16:38:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:45,443 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 16:38:45,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:38:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 16:38:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 16:38:45,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:45,444 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:45,444 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:45,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1312158088, now seen corresponding path program 22 times [2018-10-10 16:38:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:38:45,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:38:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:38:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:38:45,793 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-10-10 16:38:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:46,362 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 16:38:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 16:38:46,362 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-10-10 16:38:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:46,363 INFO L225 Difference]: With dead ends: 83 [2018-10-10 16:38:46,364 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 16:38:46,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:38:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 16:38:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-10 16:38:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-10 16:38:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-10 16:38:46,369 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-10-10 16:38:46,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:46,369 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-10 16:38:46,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:38:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-10 16:38:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 16:38:46,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:46,370 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:46,370 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:46,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:46,370 INFO L82 PathProgramCache]: Analyzing trace with hash 135257466, now seen corresponding path program 23 times [2018-10-10 16:38:46,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:46,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:46,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:38:46,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:38:46,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:38:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:38:46,816 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 27 states. [2018-10-10 16:38:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:47,606 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 16:38:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:38:47,607 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2018-10-10 16:38:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:47,608 INFO L225 Difference]: With dead ends: 85 [2018-10-10 16:38:47,608 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 16:38:47,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:38:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 16:38:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-10 16:38:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 16:38:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 16:38:47,612 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-10-10 16:38:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:47,613 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 16:38:47,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:38:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 16:38:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 16:38:47,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:47,613 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:47,614 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:47,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash -467799044, now seen corresponding path program 24 times [2018-10-10 16:38:47,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:48,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:38:48,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:38:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:38:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:38:48,015 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 28 states. [2018-10-10 16:38:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:48,662 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-10 16:38:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:38:48,662 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-10-10 16:38:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:48,663 INFO L225 Difference]: With dead ends: 87 [2018-10-10 16:38:48,664 INFO L226 Difference]: Without dead ends: 87 [2018-10-10 16:38:48,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:38:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-10 16:38:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-10 16:38:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 16:38:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 16:38:48,667 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-10-10 16:38:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:48,668 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 16:38:48,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:38:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 16:38:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 16:38:48,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:48,668 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:48,668 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -184520194, now seen corresponding path program 25 times [2018-10-10 16:38:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:49,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:49,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:38:49,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:38:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:38:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:38:49,072 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 29 states. [2018-10-10 16:38:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:49,759 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 16:38:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:38:49,760 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-10-10 16:38:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:49,760 INFO L225 Difference]: With dead ends: 89 [2018-10-10 16:38:49,760 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 16:38:49,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:38:49,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 16:38:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-10 16:38:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 16:38:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-10 16:38:49,764 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-10-10 16:38:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:49,765 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-10 16:38:49,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:38:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-10 16:38:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 16:38:49,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:49,766 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:49,766 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:49,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:49,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1463515008, now seen corresponding path program 26 times [2018-10-10 16:38:49,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:50,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:50,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:38:50,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:38:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:38:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:38:50,380 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 30 states. [2018-10-10 16:38:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:51,079 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 16:38:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:38:51,079 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-10 16:38:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:51,080 INFO L225 Difference]: With dead ends: 91 [2018-10-10 16:38:51,080 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 16:38:51,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:38:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 16:38:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-10 16:38:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 16:38:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 16:38:51,086 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-10-10 16:38:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:51,086 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 16:38:51,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:38:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 16:38:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 16:38:51,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:51,087 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:51,087 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:51,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 382411906, now seen corresponding path program 27 times [2018-10-10 16:38:51,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:51,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:51,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:38:51,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:38:51,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:38:51,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:38:51,572 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 31 states. [2018-10-10 16:38:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:52,372 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 16:38:52,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:38:52,372 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-10-10 16:38:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:52,373 INFO L225 Difference]: With dead ends: 93 [2018-10-10 16:38:52,373 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 16:38:52,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:38:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 16:38:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-10-10 16:38:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 16:38:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 16:38:52,377 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-10-10 16:38:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:52,377 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 16:38:52,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:38:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 16:38:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 16:38:52,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:52,378 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:52,379 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:52,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 824416516, now seen corresponding path program 28 times [2018-10-10 16:38:52,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:52,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:38:52,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:38:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:38:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:38:52,950 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-10-10 16:38:53,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:53,787 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 16:38:53,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:38:53,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-10-10 16:38:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:53,789 INFO L225 Difference]: With dead ends: 95 [2018-10-10 16:38:53,789 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 16:38:53,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:38:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 16:38:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-10 16:38:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 16:38:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 16:38:53,794 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-10-10 16:38:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:53,794 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 16:38:53,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:38:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 16:38:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 16:38:53,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:53,795 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:53,795 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:53,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 389084422, now seen corresponding path program 29 times [2018-10-10 16:38:53,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:38:54,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:38:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:38:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:38:54,371 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 33 states. [2018-10-10 16:38:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:55,152 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 16:38:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:38:55,153 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-10-10 16:38:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:55,153 INFO L225 Difference]: With dead ends: 97 [2018-10-10 16:38:55,153 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 16:38:55,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:38:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 16:38:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-10 16:38:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 16:38:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 16:38:55,156 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-10-10 16:38:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:55,157 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 16:38:55,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:38:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 16:38:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 16:38:55,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:55,157 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:55,157 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:55,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:55,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1353230200, now seen corresponding path program 30 times [2018-10-10 16:38:55,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:55,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:55,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:38:55,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:38:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:38:55,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:38:55,723 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 34 states. [2018-10-10 16:38:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:56,546 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-10 16:38:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:38:56,546 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 95 [2018-10-10 16:38:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:56,547 INFO L225 Difference]: With dead ends: 99 [2018-10-10 16:38:56,547 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 16:38:56,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:38:56,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 16:38:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-10 16:38:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 16:38:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 16:38:56,551 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-10-10 16:38:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:56,552 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 16:38:56,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:38:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 16:38:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 16:38:56,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:56,553 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:56,553 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:56,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash -680336502, now seen corresponding path program 31 times [2018-10-10 16:38:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:57,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:57,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:38:57,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:38:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:38:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:38:57,558 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 35 states. [2018-10-10 16:38:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:58,498 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 16:38:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:38:58,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 97 [2018-10-10 16:38:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:58,500 INFO L225 Difference]: With dead ends: 101 [2018-10-10 16:38:58,500 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 16:38:58,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:38:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 16:38:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-10 16:38:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 16:38:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-10 16:38:58,505 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-10-10 16:38:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:58,505 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-10 16:38:58,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:38:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-10 16:38:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 16:38:58,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:58,506 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:38:58,507 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:58,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1725412876, now seen corresponding path program 32 times [2018-10-10 16:38:58,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:59,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:59,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:59,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:38:59,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:38:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:38:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:38:59,196 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 36 states. [2018-10-10 16:39:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:00,175 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 16:39:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:39:00,175 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-10-10 16:39:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:00,176 INFO L225 Difference]: With dead ends: 103 [2018-10-10 16:39:00,176 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 16:39:00,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:39:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 16:39:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-10 16:39:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 16:39:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 16:39:00,180 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-10-10 16:39:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:00,180 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 16:39:00,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:39:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 16:39:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 16:39:00,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:00,181 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:00,181 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:00,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1336807410, now seen corresponding path program 33 times [2018-10-10 16:39:00,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:00,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:00,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:39:00,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:39:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:39:00,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:39:00,898 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 37 states. [2018-10-10 16:39:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:02,005 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-10 16:39:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:39:02,006 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 101 [2018-10-10 16:39:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:02,007 INFO L225 Difference]: With dead ends: 105 [2018-10-10 16:39:02,007 INFO L226 Difference]: Without dead ends: 105 [2018-10-10 16:39:02,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:39:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-10 16:39:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-10-10 16:39:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 16:39:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 16:39:02,009 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-10-10 16:39:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:02,009 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 16:39:02,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:39:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 16:39:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 16:39:02,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:02,010 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:02,010 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:02,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2077904496, now seen corresponding path program 34 times [2018-10-10 16:39:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:03,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:03,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:39:03,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:39:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:39:03,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:39:03,069 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 38 states. [2018-10-10 16:39:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:04,292 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 16:39:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:39:04,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 103 [2018-10-10 16:39:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:04,293 INFO L225 Difference]: With dead ends: 107 [2018-10-10 16:39:04,293 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 16:39:04,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:39:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 16:39:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-10 16:39:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-10 16:39:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-10 16:39:04,296 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-10-10 16:39:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:04,297 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-10 16:39:04,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:39:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-10 16:39:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 16:39:04,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:04,298 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:04,298 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:04,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1307633006, now seen corresponding path program 35 times [2018-10-10 16:39:04,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:05,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:05,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:39:05,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:39:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:39:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:39:05,017 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 39 states. [2018-10-10 16:39:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:06,066 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 16:39:06,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:39:06,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 105 [2018-10-10 16:39:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:06,068 INFO L225 Difference]: With dead ends: 109 [2018-10-10 16:39:06,068 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 16:39:06,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:39:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 16:39:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-10 16:39:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 16:39:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 16:39:06,070 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-10-10 16:39:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:06,071 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 16:39:06,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:39:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 16:39:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 16:39:06,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:06,072 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:06,072 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:06,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:06,072 INFO L82 PathProgramCache]: Analyzing trace with hash 188893972, now seen corresponding path program 36 times [2018-10-10 16:39:06,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:06,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:06,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:39:06,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:39:06,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:39:06,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:39:06,952 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 40 states. [2018-10-10 16:39:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:08,306 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-10 16:39:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:39:08,307 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 107 [2018-10-10 16:39:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:08,308 INFO L225 Difference]: With dead ends: 111 [2018-10-10 16:39:08,308 INFO L226 Difference]: Without dead ends: 111 [2018-10-10 16:39:08,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:39:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-10 16:39:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-10 16:39:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:39:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 16:39:08,312 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-10-10 16:39:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:08,312 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 16:39:08,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:39:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 16:39:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 16:39:08,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:08,313 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:08,313 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:08,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash -462724330, now seen corresponding path program 37 times [2018-10-10 16:39:08,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:09,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:09,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:39:09,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:39:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:39:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:39:09,018 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 41 states. [2018-10-10 16:39:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:10,709 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 16:39:10,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:39:10,710 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-10-10 16:39:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:10,711 INFO L225 Difference]: With dead ends: 113 [2018-10-10 16:39:10,711 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 16:39:10,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:39:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 16:39:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-10-10 16:39:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 16:39:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-10 16:39:10,715 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-10-10 16:39:10,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:10,715 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-10 16:39:10,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:39:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-10 16:39:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 16:39:10,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:10,716 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:10,716 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:10,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash 397312664, now seen corresponding path program 38 times [2018-10-10 16:39:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:11,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:39:11,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:39:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:39:11,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:39:11,643 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 42 states. [2018-10-10 16:39:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:12,941 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 16:39:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:39:12,941 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-10-10 16:39:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:12,942 INFO L225 Difference]: With dead ends: 115 [2018-10-10 16:39:12,942 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 16:39:12,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:39:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 16:39:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-10 16:39:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 16:39:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 16:39:12,946 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-10-10 16:39:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:12,946 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 16:39:12,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:39:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 16:39:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 16:39:12,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:12,947 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:12,947 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:12,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2035824230, now seen corresponding path program 39 times [2018-10-10 16:39:12,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:39:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:39:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:39:13,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:39:13,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:39:13,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:39:13,777 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 43 states. [2018-10-10 16:39:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:15,123 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-10 16:39:15,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:39:15,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-10-10 16:39:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:15,132 INFO L225 Difference]: With dead ends: 116 [2018-10-10 16:39:15,132 INFO L226 Difference]: Without dead ends: 116 [2018-10-10 16:39:15,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:39:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-10 16:39:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-10 16:39:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 16:39:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 16:39:15,134 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-10-10 16:39:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:15,135 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 16:39:15,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:39:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 16:39:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 16:39:15,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:39:15,136 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 16:39:15,136 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:39:15,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:39:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 476796956, now seen corresponding path program 40 times [2018-10-10 16:39:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:39:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:39:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2018-10-10 16:39:15,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:39:15,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 16:39:15,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:39:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:39:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:39:15,813 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 9 states. [2018-10-10 16:39:16,418 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-10 16:39:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:39:16,629 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-10 16:39:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:39:16,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-10-10 16:39:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:39:16,630 INFO L225 Difference]: With dead ends: 114 [2018-10-10 16:39:16,630 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:39:16,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:39:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:39:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:39:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:39:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:39:16,631 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2018-10-10 16:39:16,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:39:16,631 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:39:16,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:39:16,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:39:16,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:39:16,636 INFO L202 PluginConnector]: Adding new model memset2_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:39:16 BasicIcfg [2018-10-10 16:39:16,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:39:16,637 INFO L168 Benchmark]: Toolchain (without parser) took 48624.99 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -959.5 MB). Peak memory consumption was 214.9 MB. Max. memory is 7.1 GB. [2018-10-10 16:39:16,638 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:39:16,638 INFO L168 Benchmark]: Boogie Preprocessor took 51.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:39:16,639 INFO L168 Benchmark]: RCFGBuilder took 522.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 16:39:16,639 INFO L168 Benchmark]: IcfgTransformer took 1192.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2018-10-10 16:39:16,640 INFO L168 Benchmark]: TraceAbstraction took 46852.45 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2018-10-10 16:39:16,643 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 522.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 1192.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 169.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46852.45 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.3 GB in the beginning and 2.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 37 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 482 LocStat_NO_SUPPORTING_DISEQUALITIES : 106 LocStat_NO_DISJUNCTIONS : -74 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 853.92 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 65 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 39 different actions 65 times. Merged at 14 different actions 24 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. SAFE Result, 46.7s OverallTime, 41 OverallIterations, 40 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1303 SDtfs, 2319 SDslu, 20359 SDs, 0 SdLazy, 5378 SolverSat, 873 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1738 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1655 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10679 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 3075 NumberOfCodeBlocks, 3075 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 912982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/22140 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/memset2_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-39-16-656.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset2_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-39-16-656.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memset2_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-39-16-656.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...