java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:56:03,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:56:03,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:56:03,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:56:03,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:56:03,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:56:03,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:56:03,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:56:03,910 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:56:03,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:56:03,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:56:03,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:56:03,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:56:03,917 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:56:03,918 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:56:03,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:56:03,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:56:03,931 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:56:03,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:56:03,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:56:03,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:56:03,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:56:03,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:56:03,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:56:03,940 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:56:03,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:56:03,943 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:56:03,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:56:03,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:56:03,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:56:03,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:56:03,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:56:03,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:56:03,949 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:56:03,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:56:03,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:56:03,951 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-14 16:56:03,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:56:03,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:56:03,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:56:03,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:56:03,970 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:56:03,970 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:56:03,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:56:03,971 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:56:03,972 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:56:03,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:56:03,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:56:03,972 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:56:03,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:56:03,973 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:56:03,973 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:56:04,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:56:04,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:56:04,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:56:04,050 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:56:04,051 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:56:04,054 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl [2018-10-14 16:56:04,054 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl' [2018-10-14 16:56:04,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:56:04,155 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:56:04,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:56:04,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:56:04,156 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:56:04,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/1) ... [2018-10-14 16:56:04,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:56:04,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:56:04,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:56:04,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:56:04,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (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-14 16:56:04,303 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:56:04,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:56:04,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:56:05,028 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:56:05,029 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:05 BoogieIcfgContainer [2018-10-14 16:56:05,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:56:05,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:56:05,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:56:05,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:56:05,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:56:04" (1/2) ... [2018-10-14 16:56:05,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af4424d and model type test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:56:05, skipping insertion in model container [2018-10-14 16:56:05,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:56:05" (2/2) ... [2018-10-14 16:56:05,038 INFO L112 eAbstractionObserver]: Analyzing ICFG test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl [2018-10-14 16:56:05,048 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:56:05,057 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:56:05,075 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:56:05,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:56:05,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:56:05,105 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:56:05,105 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:56:05,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:56:05,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:56:05,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:56:05,105 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:56:05,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:56:05,127 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-10-14 16:56:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 16:56:05,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:05,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:05,143 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1241051684, now seen corresponding path program 1 times [2018-10-14 16:56:05,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:05,565 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-14 16:56:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:56:05,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 16:56:05,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 16:56:05,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 16:56:05,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 16:56:05,595 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-10-14 16:56:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:05,831 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-14 16:56:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 16:56:05,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-10-14 16:56:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:05,845 INFO L225 Difference]: With dead ends: 108 [2018-10-14 16:56:05,846 INFO L226 Difference]: Without dead ends: 108 [2018-10-14 16:56:05,848 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-14 16:56:05,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-14 16:56:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-14 16:56:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 16:56:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 16:56:05,894 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-14 16:56:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:05,896 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 16:56:05,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 16:56:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 16:56:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 16:56:05,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:05,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:05,900 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:05,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1354376021, now seen corresponding path program 1 times [2018-10-14 16:56:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:06,065 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-14 16:56:06,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:06,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 16:56:06,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 16:56:06,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 16:56:06,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 16:56:06,069 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 5 states. [2018-10-14 16:56:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:06,206 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-14 16:56:06,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 16:56:06,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-10-14 16:56:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:06,210 INFO L225 Difference]: With dead ends: 111 [2018-10-14 16:56:06,211 INFO L226 Difference]: Without dead ends: 111 [2018-10-14 16:56:06,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-14 16:56:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-14 16:56:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 16:56:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-14 16:56:06,223 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-14 16:56:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:06,224 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-14 16:56:06,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 16:56:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-14 16:56:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-14 16:56:06,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:06,228 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:06,228 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:06,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:06,229 INFO L82 PathProgramCache]: Analyzing trace with hash -555094212, now seen corresponding path program 2 times [2018-10-14 16:56:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:06,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 16:56:06,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:56:06,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:56:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:56:06,509 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 6 states. [2018-10-14 16:56:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:06,617 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-14 16:56:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 16:56:06,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-10-14 16:56:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:06,621 INFO L225 Difference]: With dead ends: 114 [2018-10-14 16:56:06,621 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 16:56:06,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 16:56:06,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-14 16:56:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-14 16:56:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-14 16:56:06,635 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-14 16:56:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:06,636 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-14 16:56:06,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:56:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-14 16:56:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-14 16:56:06,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:06,638 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:06,639 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:06,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1259030005, now seen corresponding path program 3 times [2018-10-14 16:56:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:06,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:06,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 16:56:06,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 16:56:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 16:56:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 16:56:06,811 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 7 states. [2018-10-14 16:56:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:07,336 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-14 16:56:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 16:56:07,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-10-14 16:56:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:07,339 INFO L225 Difference]: With dead ends: 117 [2018-10-14 16:56:07,339 INFO L226 Difference]: Without dead ends: 117 [2018-10-14 16:56:07,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-14 16:56:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-14 16:56:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 16:56:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 16:56:07,348 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-14 16:56:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:07,349 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 16:56:07,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 16:56:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 16:56:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 16:56:07,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:07,354 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:07,355 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:07,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2034874212, now seen corresponding path program 4 times [2018-10-14 16:56:07,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:07,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:07,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:56:07,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:56:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:56:07,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:56:07,615 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 8 states. [2018-10-14 16:56:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:08,094 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-14 16:56:08,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:56:08,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2018-10-14 16:56:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:08,097 INFO L225 Difference]: With dead ends: 120 [2018-10-14 16:56:08,097 INFO L226 Difference]: Without dead ends: 120 [2018-10-14 16:56:08,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-14 16:56:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-14 16:56:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 16:56:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-14 16:56:08,107 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-14 16:56:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:08,108 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-14 16:56:08,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:56:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-14 16:56:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-14 16:56:08,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:08,113 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:08,114 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:08,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash 677376149, now seen corresponding path program 5 times [2018-10-14 16:56:08,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:08,403 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:08,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 16:56:08,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 16:56:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 16:56:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 16:56:08,405 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 9 states. [2018-10-14 16:56:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:08,574 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-14 16:56:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:56:08,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 117 [2018-10-14 16:56:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:08,582 INFO L225 Difference]: With dead ends: 123 [2018-10-14 16:56:08,582 INFO L226 Difference]: Without dead ends: 123 [2018-10-14 16:56:08,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:56:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-14 16:56:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-14 16:56:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-14 16:56:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-14 16:56:08,599 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-14 16:56:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:08,599 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-14 16:56:08,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 16:56:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-14 16:56:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-14 16:56:08,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:08,602 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:08,603 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:08,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash 108141052, now seen corresponding path program 6 times [2018-10-14 16:56:08,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:56:08,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:56:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:56:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:56:08,918 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 10 states. [2018-10-14 16:56:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:09,140 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-14 16:56:09,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 16:56:09,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2018-10-14 16:56:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:09,142 INFO L225 Difference]: With dead ends: 126 [2018-10-14 16:56:09,143 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 16:56:09,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:56:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 16:56:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-14 16:56:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-14 16:56:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-14 16:56:09,149 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-14 16:56:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:09,149 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-14 16:56:09,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:56:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-14 16:56:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-14 16:56:09,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:09,151 INFO L375 BasicCegarLoop]: trace histogram [7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:09,152 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:09,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1443749067, now seen corresponding path program 7 times [2018-10-14 16:56:09,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:09,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:09,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 16:56:09,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 16:56:09,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 16:56:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 16:56:09,371 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 11 states. [2018-10-14 16:56:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:09,683 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-14 16:56:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:56:09,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2018-10-14 16:56:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:09,685 INFO L225 Difference]: With dead ends: 129 [2018-10-14 16:56:09,685 INFO L226 Difference]: Without dead ends: 129 [2018-10-14 16:56:09,686 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-14 16:56:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-14 16:56:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-14 16:56:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-14 16:56:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-14 16:56:09,689 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-14 16:56:09,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:09,690 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-14 16:56:09,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 16:56:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-14 16:56:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-14 16:56:09,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:09,692 INFO L375 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:09,692 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:09,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1520657244, now seen corresponding path program 8 times [2018-10-14 16:56:09,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:56:09,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:56:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:56:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:56:09,961 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 12 states. [2018-10-14 16:56:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:10,185 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-14 16:56:10,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:56:10,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2018-10-14 16:56:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:10,187 INFO L225 Difference]: With dead ends: 132 [2018-10-14 16:56:10,188 INFO L226 Difference]: Without dead ends: 132 [2018-10-14 16:56:10,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:56:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-14 16:56:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-14 16:56:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-14 16:56:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-14 16:56:10,193 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-14 16:56:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:10,194 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-14 16:56:10,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:56:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-14 16:56:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-14 16:56:10,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:10,196 INFO L375 BasicCegarLoop]: trace histogram [9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:10,196 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:10,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:10,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1031527893, now seen corresponding path program 9 times [2018-10-14 16:56:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 16:56:10,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 16:56:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 16:56:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:56:10,885 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 13 states. [2018-10-14 16:56:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:11,312 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-14 16:56:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:56:11,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 129 [2018-10-14 16:56:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:11,314 INFO L225 Difference]: With dead ends: 133 [2018-10-14 16:56:11,315 INFO L226 Difference]: Without dead ends: 133 [2018-10-14 16:56:11,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:56:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-14 16:56:11,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-14 16:56:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 16:56:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-14 16:56:11,319 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-14 16:56:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:11,319 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-14 16:56:11,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 16:56:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-14 16:56:11,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-14 16:56:11,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:11,320 INFO L375 BasicCegarLoop]: trace histogram [10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:56:11,320 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:11,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2091899716, now seen corresponding path program 10 times [2018-10-14 16:56:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:12,351 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-10-14 16:56:12,947 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-10-14 16:56:13,369 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 18 [2018-10-14 16:56:13,828 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2018-10-14 16:56:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:16,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:16,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:56:16,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:56:16,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:56:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:56:16,526 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-14 16:56:20,296 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 52 [2018-10-14 16:56:20,701 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2018-10-14 16:56:20,917 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 48 [2018-10-14 16:56:21,165 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 55 [2018-10-14 16:56:21,466 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 57 [2018-10-14 16:56:21,744 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 59 [2018-10-14 16:56:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:21,745 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-14 16:56:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 16:56:21,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-14 16:56:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:21,746 INFO L225 Difference]: With dead ends: 122 [2018-10-14 16:56:21,746 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 16:56:21,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 23 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=702, Invalid=4998, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 16:56:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 16:56:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 16:56:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 16:56:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 16:56:21,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2018-10-14 16:56:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:21,750 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 16:56:21,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:56:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 16:56:21,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 16:56:21,755 INFO L202 PluginConnector]: Adding new model test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 04:56:21 BoogieIcfgContainer [2018-10-14 16:56:21,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 16:56:21,757 INFO L168 Benchmark]: Toolchain (without parser) took 17602.30 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -252.2 MB). Peak memory consumption was 684.3 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,758 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 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-14 16:56:21,758 INFO L168 Benchmark]: Boogie Preprocessor took 62.85 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-14 16:56:21,759 INFO L168 Benchmark]: RCFGBuilder took 810.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,760 INFO L168 Benchmark]: TraceAbstraction took 16724.69 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -283.9 MB). Peak memory consumption was 652.6 MB. Max. memory is 7.1 GB. [2018-10-14 16:56:21,763 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.26 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 62.85 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 810.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16724.69 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 222.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -283.9 MB). Peak memory consumption was 652.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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, 107 locations, 1 error locations. SAFE Result, 16.6s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1011 SDtfs, 1079 SDslu, 5395 SDs, 0 SdLazy, 2282 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 24 SyntacticMatches, 23 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 550425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/550 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/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-14_16-56-21-774.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3.1_true-valid-memsafety_true-termination.i_11.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-14_16-56-21-774.csv Received shutdown request...