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/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:35:20,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:35:20,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:35:20,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:35:20,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:35:20,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:35:20,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:35:20,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:35:20,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:35:20,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:35:20,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:35:20,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:35:20,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:35:20,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:35:20,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:35:20,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:35:20,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:35:20,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:35:20,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:35:20,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:35:20,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:35:20,348 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:35:20,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:35:20,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:35:20,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:35:20,352 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:35:20,353 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:35:20,354 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:35:20,355 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:35:20,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:35:20,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:35:20,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:35:20,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:35:20,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:35:20,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:35:20,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:35:20,360 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:35:20,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:35:20,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:35:20,372 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:35:20,373 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:35:20,373 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:35:20,373 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:35:20,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:35:20,374 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:35:20,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:35:20,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:35:20,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:35:20,375 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:35:20,375 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:35:20,376 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:35:20,376 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:35:20,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:35:20,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:35:20,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:35:20,441 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:35:20,441 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:35:20,442 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 16:35:20,443 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl' [2018-10-10 16:35:20,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:35:20,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:35:20,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:35:20,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:35:20,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:35:20,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/1) ... [2018-10-10 16:35:20,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:35:20,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:35:20,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:35:20,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:35:20,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (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:35:20,664 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:35:20,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:35:20,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:35:21,489 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:35:21,490 INFO L202 PluginConnector]: Adding new model diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:35:21 BoogieIcfgContainer [2018-10-10 16:35:21,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:35:21,490 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:35:21,491 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:35:21,492 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:35:21,496 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:35:21" (1/1) ... [2018-10-10 16:35:21,504 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:35:21,505 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:35:21,550 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:35:21,596 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:35:21,613 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:35:21,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:35:49,371 INFO L315 AbstractInterpreter]: Visited 118 different actions 373 times. Merged at 58 different actions 234 times. Widened at 5 different actions 12 times. Found 20 fixpoints after 10 different actions. Largest state had 0 variables. [2018-10-10 16:35:49,374 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:35:49,381 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:35:49,424 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:35:49,428 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_12|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:35:49,429 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_12|) |v_ULTIMATE.start_read~int_#ptr.offset_8|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:35:49,431 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:35:49,432 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:35:49,434 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_18|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-10 16:35:49,435 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_18|) |v_ULTIMATE.start_read~int_#ptr.offset_12|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-10 16:35:49,436 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:35:49,437 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:35:49,437 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:35:49,438 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:35:49,438 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:35:49,438 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:35:49,438 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:35:49,438 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:35:49,439 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:35:49,439 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:35:49,439 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:35:49,439 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:35:49,440 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:35:49,440 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:35:49,440 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:35:49,441 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:35:49,468 INFO L202 PluginConnector]: Adding new model diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:35:49 BasicIcfg [2018-10-10 16:35:49,468 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:35:49,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:35:49,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:35:49,474 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:35:49,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:35:20" (1/3) ... [2018-10-10 16:35:49,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5deb5d and model type diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:35:49, skipping insertion in model container [2018-10-10 16:35:49,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:35:21" (2/3) ... [2018-10-10 16:35:49,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5deb5d and model type diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:35:49, skipping insertion in model container [2018-10-10 16:35:49,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:35:49" (3/3) ... [2018-10-10 16:35:49,479 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:35:49,494 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:35:49,504 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:35:49,520 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:35:49,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:35:49,544 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:35:49,544 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:35:49,544 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:35:49,544 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:35:49,544 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:35:49,544 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:35:49,544 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:35:49,545 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:35:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-10-10 16:35:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 16:35:49,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:49,572 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] [2018-10-10 16:35:49,573 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:49,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2033254191, now seen corresponding path program 1 times [2018-10-10 16:35:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:50,201 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:35:50,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:35:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 16:35:50,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:35:50,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:35:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:35:50,344 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 8 states. [2018-10-10 16:35:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:50,716 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2018-10-10 16:35:50,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:35:50,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-10-10 16:35:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:50,733 INFO L225 Difference]: With dead ends: 173 [2018-10-10 16:35:50,733 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 16:35:50,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:35:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 16:35:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2018-10-10 16:35:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 16:35:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-10-10 16:35:50,790 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 76 [2018-10-10 16:35:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:50,790 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-10-10 16:35:50,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:35:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-10-10 16:35:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 16:35:50,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:50,794 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] [2018-10-10 16:35:50,795 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:50,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash -15035286, now seen corresponding path program 1 times [2018-10-10 16:35:50,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:35:50,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:35:50,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 16:35:50,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 16:35:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 16:35:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:35:50,960 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 4 states. [2018-10-10 16:35:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:51,134 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-10 16:35:51,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 16:35:51,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-10-10 16:35:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:51,139 INFO L225 Difference]: With dead ends: 128 [2018-10-10 16:35:51,139 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 16:35:51,140 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:35:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 16:35:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2018-10-10 16:35:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 16:35:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-10-10 16:35:51,149 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 97 [2018-10-10 16:35:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:51,150 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-10-10 16:35:51,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 16:35:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-10-10 16:35:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 16:35:51,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:51,152 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] [2018-10-10 16:35:51,152 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:51,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1141910679, now seen corresponding path program 1 times [2018-10-10 16:35:51,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:35:52,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:35:52,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 16:35:52,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:35:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:35:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:35:52,117 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 12 states. [2018-10-10 16:35:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:52,885 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2018-10-10 16:35:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:35:52,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-10-10 16:35:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:52,889 INFO L225 Difference]: With dead ends: 171 [2018-10-10 16:35:52,889 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 16:35:52,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:35:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 16:35:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-10 16:35:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 16:35:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2018-10-10 16:35:52,901 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 170 transitions. Word has length 99 [2018-10-10 16:35:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:52,901 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 170 transitions. [2018-10-10 16:35:52,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:35:52,902 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 170 transitions. [2018-10-10 16:35:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 16:35:52,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:52,905 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:35:52,905 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:52,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash 110410242, now seen corresponding path program 1 times [2018-10-10 16:35:52,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:35:53,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:53,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:35:53,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:35:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:35:53,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:35:53,763 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand 19 states. [2018-10-10 16:35:55,343 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-10 16:35:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:56,656 INFO L93 Difference]: Finished difference Result 385 states and 403 transitions. [2018-10-10 16:35:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:35:56,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 150 [2018-10-10 16:35:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:56,661 INFO L225 Difference]: With dead ends: 385 [2018-10-10 16:35:56,661 INFO L226 Difference]: Without dead ends: 385 [2018-10-10 16:35:56,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:35:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-10 16:35:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 212. [2018-10-10 16:35:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 16:35:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2018-10-10 16:35:56,678 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 150 [2018-10-10 16:35:56,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:56,678 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2018-10-10 16:35:56,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:35:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2018-10-10 16:35:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 16:35:56,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:56,682 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:35:56,683 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:56,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:56,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1652445085, now seen corresponding path program 1 times [2018-10-10 16:35:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 16:35:57,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:57,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:35:57,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:35:57,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:35:57,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:35:57,392 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand 21 states. [2018-10-10 16:35:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:59,760 INFO L93 Difference]: Finished difference Result 436 states and 457 transitions. [2018-10-10 16:35:59,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:35:59,761 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2018-10-10 16:35:59,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:59,765 INFO L225 Difference]: With dead ends: 436 [2018-10-10 16:35:59,765 INFO L226 Difference]: Without dead ends: 436 [2018-10-10 16:35:59,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=428, Invalid=1378, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:35:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-10 16:35:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 248. [2018-10-10 16:35:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 16:35:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 260 transitions. [2018-10-10 16:35:59,781 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 260 transitions. Word has length 179 [2018-10-10 16:35:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:59,782 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 260 transitions. [2018-10-10 16:35:59,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:35:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 260 transitions. [2018-10-10 16:35:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 16:35:59,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:59,786 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:35:59,786 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:59,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1654019785, now seen corresponding path program 2 times [2018-10-10 16:35:59,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 135 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 16:36:00,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:00,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:36:00,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:36:00,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:36:00,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:36:00,889 INFO L87 Difference]: Start difference. First operand 248 states and 260 transitions. Second operand 23 states. [2018-10-10 16:36:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:04,225 INFO L93 Difference]: Finished difference Result 491 states and 515 transitions. [2018-10-10 16:36:04,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:36:04,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 201 [2018-10-10 16:36:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:04,228 INFO L225 Difference]: With dead ends: 491 [2018-10-10 16:36:04,228 INFO L226 Difference]: Without dead ends: 361 [2018-10-10 16:36:04,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=658, Invalid=2204, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:36:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-10 16:36:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 298. [2018-10-10 16:36:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 16:36:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-10-10 16:36:04,242 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 201 [2018-10-10 16:36:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:04,242 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-10-10 16:36:04,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:36:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-10-10 16:36:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-10 16:36:04,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:04,246 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:36:04,247 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:04,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash 745374114, now seen corresponding path program 2 times [2018-10-10 16:36:04,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 26 proven. 153 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 16:36:04,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:36:04,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:36:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:36:04,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:36:04,944 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 23 states. [2018-10-10 16:36:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:07,690 INFO L93 Difference]: Finished difference Result 467 states and 490 transitions. [2018-10-10 16:36:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:36:07,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 208 [2018-10-10 16:36:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:07,695 INFO L225 Difference]: With dead ends: 467 [2018-10-10 16:36:07,695 INFO L226 Difference]: Without dead ends: 467 [2018-10-10 16:36:07,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=501, Invalid=1755, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:36:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-10 16:36:07,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 298. [2018-10-10 16:36:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 16:36:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-10-10 16:36:07,706 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 208 [2018-10-10 16:36:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:07,707 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-10-10 16:36:07,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:36:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-10-10 16:36:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 16:36:07,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:07,712 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:36:07,712 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:07,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash 737082620, now seen corresponding path program 3 times [2018-10-10 16:36:07,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 32 proven. 186 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 16:36:09,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:09,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:36:09,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:36:09,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:36:09,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:36:09,067 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 25 states. [2018-10-10 16:36:10,313 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-10 16:36:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:12,411 INFO L93 Difference]: Finished difference Result 478 states and 501 transitions. [2018-10-10 16:36:12,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:36:12,414 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 230 [2018-10-10 16:36:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:12,416 INFO L225 Difference]: With dead ends: 478 [2018-10-10 16:36:12,417 INFO L226 Difference]: Without dead ends: 255 [2018-10-10 16:36:12,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=774, Invalid=2648, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:36:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-10 16:36:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2018-10-10 16:36:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-10 16:36:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 258 transitions. [2018-10-10 16:36:12,423 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 258 transitions. Word has length 230 [2018-10-10 16:36:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:12,424 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 258 transitions. [2018-10-10 16:36:12,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:36:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 258 transitions. [2018-10-10 16:36:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 16:36:12,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:12,426 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:36:12,426 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:12,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -543940920, now seen corresponding path program 4 times [2018-10-10 16:36:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 5 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 16:36:13,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:13,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:36:13,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:36:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:36:13,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:36:13,252 INFO L87 Difference]: Start difference. First operand 247 states and 258 transitions. Second operand 25 states. [2018-10-10 16:36:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:17,424 INFO L93 Difference]: Finished difference Result 478 states and 501 transitions. [2018-10-10 16:36:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:36:17,425 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 230 [2018-10-10 16:36:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:17,428 INFO L225 Difference]: With dead ends: 478 [2018-10-10 16:36:17,428 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 16:36:17,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=780, Invalid=2642, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:36:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 16:36:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 282. [2018-10-10 16:36:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 16:36:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 295 transitions. [2018-10-10 16:36:17,436 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 295 transitions. Word has length 230 [2018-10-10 16:36:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:17,436 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 295 transitions. [2018-10-10 16:36:17,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:36:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 295 transitions. [2018-10-10 16:36:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 16:36:17,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:17,438 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:36:17,439 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:17,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:17,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1696508713, now seen corresponding path program 5 times [2018-10-10 16:36:17,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 299 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 16:36:18,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:18,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:36:18,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:36:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:36:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:36:18,318 INFO L87 Difference]: Start difference. First operand 282 states and 295 transitions. Second operand 27 states. [2018-10-10 16:36:22,349 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-10 16:36:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:22,411 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-10-10 16:36:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:36:22,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 259 [2018-10-10 16:36:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:22,412 INFO L225 Difference]: With dead ends: 351 [2018-10-10 16:36:22,412 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:36:22,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=853, Invalid=3179, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:36:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:36:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:36:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:36:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:36:22,416 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2018-10-10 16:36:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:22,416 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:36:22,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:36:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:36:22,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:36:22,420 INFO L202 PluginConnector]: Adding new model diff-alloca_true-valid-memsafety_true-termination.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:36:22 BasicIcfg [2018-10-10 16:36:22,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:36:22,421 INFO L168 Benchmark]: Toolchain (without parser) took 61908.84 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -227.9 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-10-10 16:36:22,423 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:36:22,423 INFO L168 Benchmark]: Boogie Preprocessor took 62.44 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:36:22,424 INFO L168 Benchmark]: RCFGBuilder took 912.46 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-10 16:36:22,425 INFO L168 Benchmark]: IcfgTransformer took 27978.13 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -170.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-10 16:36:22,426 INFO L168 Benchmark]: TraceAbstraction took 32950.72 ms. Allocated memory was 2.9 GB in the beginning and 3.8 GB in the end (delta: 874.0 MB). Free memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: -88.9 MB). Peak memory consumption was 785.0 MB. Max. memory is 7.1 GB. [2018-10-10 16:36:22,430 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.21 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.44 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 912.46 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. * IcfgTransformer took 27978.13 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -170.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * TraceAbstraction took 32950.72 ms. Allocated memory was 2.9 GB in the beginning and 3.8 GB in the end (delta: 874.0 MB). Free memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: -88.9 MB). Peak memory consumption was 785.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 113 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 4274 LocStat_NO_SUPPORTING_DISEQUALITIES : 704 LocStat_NO_DISJUNCTIONS : -226 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 118 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 113 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 119 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 16497.04 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 375 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 118 different actions 373 times. Merged at 58 different actions 234 times. Widened at 5 different actions 12 times. Found 20 fixpoints after 10 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 2 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: 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, 115 locations, 1 error locations. SAFE Result, 32.8s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 24.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1906 SDtfs, 16712 SDslu, 14853 SDs, 0 SdLazy, 7196 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 19.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=6, 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, 10 MinimizatonAttempts, 687 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1729 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1719 ConstructedInterpolants, 0 QuantifiedInterpolants, 4715625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 123/1246 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/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-36-22-446.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-36-22-446.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-36-22-446.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...