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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:07:06,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:07:06,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:07:06,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:07:06,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:07:06,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:07:06,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:07:06,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:07:06,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:07:06,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:07:06,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:07:06,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:07:06,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:07:06,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:07:06,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:07:06,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:07:06,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:07:06,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:07:06,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:07:06,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:07:06,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:07:06,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:07:06,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:07:06,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:07:06,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:07:06,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:07:06,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:07:06,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:07:06,858 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:07:06,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:07:06,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:07:06,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:07:06,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:07:06,861 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:07:06,862 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:07:06,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:07:06,864 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-15 15:07:06,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:07:06,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:07:06,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:07:06,885 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:07:06,885 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:07:06,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:07:06,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:07:06,889 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:07:06,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:07:06,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:07:06,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:07:06,890 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:07:06,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:07:06,892 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:07:06,892 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:07:06,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:07:06,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:07:06,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:07:06,961 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:07:06,961 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:07:06,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-15 15:07:06,963 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl' [2018-10-15 15:07:07,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:07:07,038 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:07:07,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:07:07,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:07:07,038 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:07:07,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/1) ... [2018-10-15 15:07:07,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:07:07,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:07:07,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:07:07,100 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:07:07,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (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-15 15:07:07,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:07:07,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:07:08,160 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:07:08,160 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:08 BoogieIcfgContainer [2018-10-15 15:07:08,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:07:08,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:07:08,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:07:08,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:07:08,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:07:07" (1/2) ... [2018-10-15 15:07:08,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17163702 and model type pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:07:08, skipping insertion in model container [2018-10-15 15:07:08,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:07:08" (2/2) ... [2018-10-15 15:07:08,170 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl [2018-10-15 15:07:08,180 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:07:08,189 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:07:08,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:07:08,237 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:07:08,238 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:07:08,238 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:07:08,238 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:07:08,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:07:08,239 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:07:08,239 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:07:08,239 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:07:08,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:07:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-15 15:07:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 15:07:08,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:08,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:08,294 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:08,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1538501434, now seen corresponding path program 1 times [2018-10-15 15:07:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:08,848 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-15 15:07:08,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:08,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:08,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:08,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:08,881 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-10-15 15:07:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:09,016 INFO L93 Difference]: Finished difference Result 285 states and 294 transitions. [2018-10-15 15:07:09,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:09,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2018-10-15 15:07:09,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:09,037 INFO L225 Difference]: With dead ends: 285 [2018-10-15 15:07:09,037 INFO L226 Difference]: Without dead ends: 285 [2018-10-15 15:07:09,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-15 15:07:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-15 15:07:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-15 15:07:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 292 transitions. [2018-10-15 15:07:09,114 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 292 transitions. Word has length 189 [2018-10-15 15:07:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:09,119 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 292 transitions. [2018-10-15 15:07:09,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 292 transitions. [2018-10-15 15:07:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-15 15:07:09,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:09,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:09,134 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:09,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:09,135 INFO L82 PathProgramCache]: Analyzing trace with hash -753046899, now seen corresponding path program 1 times [2018-10-15 15:07:09,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:09,444 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-15 15:07:09,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:09,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-15 15:07:09,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 15:07:09,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 15:07:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 15:07:09,449 INFO L87 Difference]: Start difference. First operand 282 states and 292 transitions. Second operand 8 states. [2018-10-15 15:07:10,000 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 15:07:10,206 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:07:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:10,482 INFO L93 Difference]: Finished difference Result 456 states and 475 transitions. [2018-10-15 15:07:10,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 15:07:10,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2018-10-15 15:07:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:10,489 INFO L225 Difference]: With dead ends: 456 [2018-10-15 15:07:10,490 INFO L226 Difference]: Without dead ends: 456 [2018-10-15 15:07:10,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-15 15:07:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-10-15 15:07:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 300. [2018-10-15 15:07:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 15:07:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 310 transitions. [2018-10-15 15:07:10,524 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 310 transitions. Word has length 191 [2018-10-15 15:07:10,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:10,528 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 310 transitions. [2018-10-15 15:07:10,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 15:07:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 310 transitions. [2018-10-15 15:07:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:07:10,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:10,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:10,533 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:10,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 911232119, now seen corresponding path program 1 times [2018-10-15 15:07:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:10,735 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-15 15:07:10,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:10,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:10,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:10,737 INFO L87 Difference]: Start difference. First operand 300 states and 310 transitions. Second operand 3 states. [2018-10-15 15:07:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:10,800 INFO L93 Difference]: Finished difference Result 434 states and 451 transitions. [2018-10-15 15:07:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:10,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-15 15:07:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:10,809 INFO L225 Difference]: With dead ends: 434 [2018-10-15 15:07:10,809 INFO L226 Difference]: Without dead ends: 434 [2018-10-15 15:07:10,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-15 15:07:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2018-10-15 15:07:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-15 15:07:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 449 transitions. [2018-10-15 15:07:10,846 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 449 transitions. Word has length 192 [2018-10-15 15:07:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:10,847 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 449 transitions. [2018-10-15 15:07:10,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 449 transitions. [2018-10-15 15:07:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 15:07:10,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:10,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:10,859 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:10,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -914189192, now seen corresponding path program 1 times [2018-10-15 15:07:10,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:11,112 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-15 15:07:11,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:11,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:11,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:11,115 INFO L87 Difference]: Start difference. First operand 432 states and 449 transitions. Second operand 3 states. [2018-10-15 15:07:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:11,224 INFO L93 Difference]: Finished difference Result 589 states and 614 transitions. [2018-10-15 15:07:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:11,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2018-10-15 15:07:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:11,229 INFO L225 Difference]: With dead ends: 589 [2018-10-15 15:07:11,229 INFO L226 Difference]: Without dead ends: 589 [2018-10-15 15:07:11,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-15 15:07:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 586. [2018-10-15 15:07:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-10-15 15:07:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 612 transitions. [2018-10-15 15:07:11,250 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 612 transitions. Word has length 194 [2018-10-15 15:07:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:11,251 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 612 transitions. [2018-10-15 15:07:11,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 612 transitions. [2018-10-15 15:07:11,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-15 15:07:11,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:11,256 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:11,257 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:11,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1910974669, now seen corresponding path program 1 times [2018-10-15 15:07:11,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:11,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:11,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:11,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:11,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:11,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:11,599 INFO L87 Difference]: Start difference. First operand 586 states and 612 transitions. Second operand 3 states. [2018-10-15 15:07:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:11,643 INFO L93 Difference]: Finished difference Result 1015 states and 1061 transitions. [2018-10-15 15:07:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:11,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2018-10-15 15:07:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:11,651 INFO L225 Difference]: With dead ends: 1015 [2018-10-15 15:07:11,652 INFO L226 Difference]: Without dead ends: 1015 [2018-10-15 15:07:11,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-10-15 15:07:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 988. [2018-10-15 15:07:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-15 15:07:11,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1035 transitions. [2018-10-15 15:07:11,678 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1035 transitions. Word has length 251 [2018-10-15 15:07:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:11,678 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1035 transitions. [2018-10-15 15:07:11,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1035 transitions. [2018-10-15 15:07:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 15:07:11,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:11,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:11,684 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:11,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:11,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1357354287, now seen corresponding path program 1 times [2018-10-15 15:07:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-15 15:07:11,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:11,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:11,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:11,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:11,949 INFO L87 Difference]: Start difference. First operand 988 states and 1035 transitions. Second operand 3 states. [2018-10-15 15:07:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:12,042 INFO L93 Difference]: Finished difference Result 991 states and 1031 transitions. [2018-10-15 15:07:12,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:12,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-10-15 15:07:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:12,049 INFO L225 Difference]: With dead ends: 991 [2018-10-15 15:07:12,049 INFO L226 Difference]: Without dead ends: 991 [2018-10-15 15:07:12,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-10-15 15:07:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 988. [2018-10-15 15:07:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-15 15:07:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1029 transitions. [2018-10-15 15:07:12,072 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1029 transitions. Word has length 252 [2018-10-15 15:07:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:12,075 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1029 transitions. [2018-10-15 15:07:12,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1029 transitions. [2018-10-15 15:07:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 15:07:12,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:12,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:12,084 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:12,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash -608237907, now seen corresponding path program 2 times [2018-10-15 15:07:12,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:07:12,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:12,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:12,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:12,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:12,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:12,330 INFO L87 Difference]: Start difference. First operand 988 states and 1029 transitions. Second operand 3 states. [2018-10-15 15:07:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:12,433 INFO L93 Difference]: Finished difference Result 1801 states and 1871 transitions. [2018-10-15 15:07:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:12,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2018-10-15 15:07:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:12,442 INFO L225 Difference]: With dead ends: 1801 [2018-10-15 15:07:12,443 INFO L226 Difference]: Without dead ends: 1801 [2018-10-15 15:07:12,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2018-10-15 15:07:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1750. [2018-10-15 15:07:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-15 15:07:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1821 transitions. [2018-10-15 15:07:12,476 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1821 transitions. Word has length 252 [2018-10-15 15:07:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:12,477 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1821 transitions. [2018-10-15 15:07:12,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1821 transitions. [2018-10-15 15:07:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:07:12,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:12,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:12,481 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:12,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1687864330, now seen corresponding path program 1 times [2018-10-15 15:07:12,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-15 15:07:12,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:07:12,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:07:12,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:07:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:07:12,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:12,615 INFO L87 Difference]: Start difference. First operand 1750 states and 1821 transitions. Second operand 3 states. [2018-10-15 15:07:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:12,698 INFO L93 Difference]: Finished difference Result 949 states and 977 transitions. [2018-10-15 15:07:12,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:07:12,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-10-15 15:07:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:12,703 INFO L225 Difference]: With dead ends: 949 [2018-10-15 15:07:12,704 INFO L226 Difference]: Without dead ends: 949 [2018-10-15 15:07:12,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:07:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-10-15 15:07:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 946. [2018-10-15 15:07:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-10-15 15:07:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 975 transitions. [2018-10-15 15:07:12,722 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 975 transitions. Word has length 253 [2018-10-15 15:07:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:12,723 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 975 transitions. [2018-10-15 15:07:12,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:07:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 975 transitions. [2018-10-15 15:07:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:07:12,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:12,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:12,725 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:12,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:12,726 INFO L82 PathProgramCache]: Analyzing trace with hash -798225974, now seen corresponding path program 2 times [2018-10-15 15:07:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-15 15:07:13,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:13,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:07:13,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:07:13,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:07:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:07:13,148 INFO L87 Difference]: Start difference. First operand 946 states and 975 transitions. Second operand 4 states. [2018-10-15 15:07:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:13,313 INFO L93 Difference]: Finished difference Result 1430 states and 1467 transitions. [2018-10-15 15:07:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:07:13,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2018-10-15 15:07:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:13,320 INFO L225 Difference]: With dead ends: 1430 [2018-10-15 15:07:13,320 INFO L226 Difference]: Without dead ends: 1430 [2018-10-15 15:07:13,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:07:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2018-10-15 15:07:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1426. [2018-10-15 15:07:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1426 states. [2018-10-15 15:07:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1463 transitions. [2018-10-15 15:07:13,350 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1463 transitions. Word has length 253 [2018-10-15 15:07:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:13,350 INFO L481 AbstractCegarLoop]: Abstraction has 1426 states and 1463 transitions. [2018-10-15 15:07:13,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:07:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1463 transitions. [2018-10-15 15:07:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 15:07:13,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:13,354 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:13,355 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:13,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1660086537, now seen corresponding path program 3 times [2018-10-15 15:07:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 27 proven. 207 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-15 15:07:14,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:14,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:07:14,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:07:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:07:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:07:14,090 INFO L87 Difference]: Start difference. First operand 1426 states and 1463 transitions. Second operand 5 states. [2018-10-15 15:07:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:14,286 INFO L93 Difference]: Finished difference Result 1910 states and 1955 transitions. [2018-10-15 15:07:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:07:14,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2018-10-15 15:07:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:14,295 INFO L225 Difference]: With dead ends: 1910 [2018-10-15 15:07:14,296 INFO L226 Difference]: Without dead ends: 1910 [2018-10-15 15:07:14,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:07:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2018-10-15 15:07:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1906. [2018-10-15 15:07:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2018-10-15 15:07:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 1951 transitions. [2018-10-15 15:07:14,328 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 1951 transitions. Word has length 373 [2018-10-15 15:07:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:14,329 INFO L481 AbstractCegarLoop]: Abstraction has 1906 states and 1951 transitions. [2018-10-15 15:07:14,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:07:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 1951 transitions. [2018-10-15 15:07:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-10-15 15:07:14,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:07:14,334 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 15:07:14,334 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:07:14,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:07:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash 355305288, now seen corresponding path program 4 times [2018-10-15 15:07:14,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:07:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:07:15,023 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-15 15:07:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 466 proven. 136 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-15 15:07:15,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:07:15,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 15:07:15,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 15:07:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 15:07:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-15 15:07:15,767 INFO L87 Difference]: Start difference. First operand 1906 states and 1951 transitions. Second operand 10 states. [2018-10-15 15:07:17,275 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-10-15 15:07:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:07:17,553 INFO L93 Difference]: Finished difference Result 278 states and 277 transitions. [2018-10-15 15:07:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:07:17,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 493 [2018-10-15 15:07:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:07:17,554 INFO L225 Difference]: With dead ends: 278 [2018-10-15 15:07:17,554 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:07:17,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:07:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:07:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:07:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:07:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:07:17,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 493 [2018-10-15 15:07:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:07:17,556 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:07:17,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 15:07:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:07:17,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:07:17,562 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:07:17 BoogieIcfgContainer [2018-10-15 15:07:17,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:07:17,563 INFO L168 Benchmark]: Toolchain (without parser) took 10525.94 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -347.6 MB). Peak memory consumption was 93.4 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:17,564 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:07:17,565 INFO L168 Benchmark]: Boogie Preprocessor took 60.49 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-15 15:07:17,565 INFO L168 Benchmark]: RCFGBuilder took 1061.61 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:17,566 INFO L168 Benchmark]: TraceAbstraction took 9399.83 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -389.9 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:07:17,570 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.49 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 1061.61 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9399.83 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -389.9 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 390]: 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, 216 locations, 1 error locations. SAFE Result, 9.3s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2692 SDtfs, 1644 SDslu, 4160 SDs, 0 SdLazy, 367 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1906occurred 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 256 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2893 NumberOfCodeBlocks, 2893 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2882 ConstructedInterpolants, 0 QuantifiedInterpolants, 5203058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 864/1232 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/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-07-17-581.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_10.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-07-17-581.csv Received shutdown request...