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/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:34:26,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:34:26,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:34:26,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:34:26,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:34:26,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:34:26,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:34:26,231 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:34:26,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:34:26,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:34:26,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:34:26,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:34:26,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:34:26,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:34:26,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:34:26,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:34:26,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:34:26,254 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:34:26,259 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:34:26,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:34:26,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:34:26,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:34:26,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:34:26,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:34:26,270 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:34:26,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:34:26,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:34:26,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:34:26,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:34:26,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:34:26,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:34:26,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:34:26,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:34:26,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:34:26,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:34:26,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:34:26,279 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:34:26,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:34:26,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:34:26,290 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:34:26,290 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:34:26,291 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:34:26,291 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:34:26,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:34:26,292 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:34:26,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:34:26,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:34:26,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:34:26,293 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:34:26,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:34:26,294 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:34:26,294 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:34:26,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:34:26,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:34:26,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:34:26,383 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:34:26,384 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:34:26,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-10-15 15:34:26,385 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-10-15 15:34:26,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:34:26,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:34:26,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:34:26,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:34:26,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:34:26,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/1) ... [2018-10-15 15:34:26,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:34:26,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:34:26,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:34:26,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:34:26,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (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:34:26,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:34:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:34:27,842 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:34:27,843 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:27 BoogieIcfgContainer [2018-10-15 15:34:27,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:34:27,843 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:34:27,844 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:34:27,845 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:34:27,849 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:27" (1/1) ... [2018-10-15 15:34:27,854 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:34:27,880 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:27 BasicIcfg [2018-10-15 15:34:27,880 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:34:27,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:34:27,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:34:27,885 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:34:27,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:26" (1/3) ... [2018-10-15 15:34:27,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb3b711 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:34:27, skipping insertion in model container [2018-10-15 15:34:27,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:27" (2/3) ... [2018-10-15 15:34:27,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb3b711 and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:27, skipping insertion in model container [2018-10-15 15:34:27,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:27" (3/3) ... [2018-10-15 15:34:27,889 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bplleft_unchanged_by_heapseparator [2018-10-15 15:34:27,898 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:34:27,907 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:34:27,920 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:34:27,947 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:34:27,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:34:27,949 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:34:27,949 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:34:27,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:34:27,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:34:27,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:34:27,950 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:34:27,950 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:34:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-10-15 15:34:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 15:34:27,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:27,996 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] [2018-10-15 15:34:27,997 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:28,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1520513769, now seen corresponding path program 1 times [2018-10-15 15:34:28,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:28,377 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:34:28,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:28,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:28,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:28,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:28,406 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 3 states. [2018-10-15 15:34:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:28,559 INFO L93 Difference]: Finished difference Result 402 states and 418 transitions. [2018-10-15 15:34:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:28,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-15 15:34:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:28,584 INFO L225 Difference]: With dead ends: 402 [2018-10-15 15:34:28,584 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 15:34:28,587 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:34:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 15:34:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 380. [2018-10-15 15:34:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 15:34:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 396 transitions. [2018-10-15 15:34:28,665 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 396 transitions. Word has length 162 [2018-10-15 15:34:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:28,667 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 396 transitions. [2018-10-15 15:34:28,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 396 transitions. [2018-10-15 15:34:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-15 15:34:28,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:28,673 INFO L375 BasicCegarLoop]: trace histogram [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:34:28,673 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:28,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:28,674 INFO L82 PathProgramCache]: Analyzing trace with hash 588084260, now seen corresponding path program 1 times [2018-10-15 15:34:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:34:28,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:28,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:28,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:28,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:28,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:28,845 INFO L87 Difference]: Start difference. First operand 380 states and 396 transitions. Second operand 3 states. [2018-10-15 15:34:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:29,489 INFO L93 Difference]: Finished difference Result 393 states and 409 transitions. [2018-10-15 15:34:29,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:29,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-15 15:34:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:29,499 INFO L225 Difference]: With dead ends: 393 [2018-10-15 15:34:29,499 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 15:34:29,500 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:34:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 15:34:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-10-15 15:34:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-15 15:34:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 409 transitions. [2018-10-15 15:34:29,530 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 409 transitions. Word has length 183 [2018-10-15 15:34:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:29,532 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 409 transitions. [2018-10-15 15:34:29,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 409 transitions. [2018-10-15 15:34:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 15:34:29,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:29,538 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-15 15:34:29,539 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:29,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash -569381036, now seen corresponding path program 1 times [2018-10-15 15:34:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-15 15:34:29,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:29,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:29,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:29,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:29,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:29,753 INFO L87 Difference]: Start difference. First operand 393 states and 409 transitions. Second operand 3 states. [2018-10-15 15:34:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:30,040 INFO L93 Difference]: Finished difference Result 408 states and 424 transitions. [2018-10-15 15:34:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:30,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-15 15:34:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:30,046 INFO L225 Difference]: With dead ends: 408 [2018-10-15 15:34:30,047 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 15:34:30,047 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:34:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 15:34:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-10-15 15:34:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-15 15:34:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 424 transitions. [2018-10-15 15:34:30,077 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 424 transitions. Word has length 205 [2018-10-15 15:34:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:30,078 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 424 transitions. [2018-10-15 15:34:30,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 424 transitions. [2018-10-15 15:34:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:34:30,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:30,084 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-15 15:34:30,085 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:30,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -281405699, now seen corresponding path program 1 times [2018-10-15 15:34:30,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-15 15:34:30,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:30,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:30,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:30,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:30,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:30,328 INFO L87 Difference]: Start difference. First operand 408 states and 424 transitions. Second operand 3 states. [2018-10-15 15:34:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:30,526 INFO L93 Difference]: Finished difference Result 425 states and 441 transitions. [2018-10-15 15:34:30,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:30,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-10-15 15:34:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:30,529 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:34:30,530 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 15:34:30,530 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:34:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 15:34:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-10-15 15:34:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 15:34:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 441 transitions. [2018-10-15 15:34:30,541 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 441 transitions. Word has length 229 [2018-10-15 15:34:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:30,543 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 441 transitions. [2018-10-15 15:34:30,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 441 transitions. [2018-10-15 15:34:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 15:34:30,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:30,547 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2018-10-15 15:34:30,548 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:30,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash -881704224, now seen corresponding path program 1 times [2018-10-15 15:34:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-15 15:34:30,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:30,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:30,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:30,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:30,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:30,743 INFO L87 Difference]: Start difference. First operand 425 states and 441 transitions. Second operand 3 states. [2018-10-15 15:34:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:30,877 INFO L93 Difference]: Finished difference Result 543 states and 569 transitions. [2018-10-15 15:34:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:30,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-10-15 15:34:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:30,881 INFO L225 Difference]: With dead ends: 543 [2018-10-15 15:34:30,881 INFO L226 Difference]: Without dead ends: 543 [2018-10-15 15:34:30,882 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:34:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-10-15 15:34:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 521. [2018-10-15 15:34:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-15 15:34:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 547 transitions. [2018-10-15 15:34:30,894 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 547 transitions. Word has length 255 [2018-10-15 15:34:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:30,895 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 547 transitions. [2018-10-15 15:34:30,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 547 transitions. [2018-10-15 15:34:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-15 15:34:30,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:30,899 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:30,899 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:30,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1087568284, now seen corresponding path program 1 times [2018-10-15 15:34:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-15 15:34:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:31,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:31,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:31,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:31,078 INFO L87 Difference]: Start difference. First operand 521 states and 547 transitions. Second operand 3 states. [2018-10-15 15:34:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:31,948 INFO L93 Difference]: Finished difference Result 540 states and 566 transitions. [2018-10-15 15:34:31,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:31,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-10-15 15:34:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:31,954 INFO L225 Difference]: With dead ends: 540 [2018-10-15 15:34:31,955 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 15:34:31,955 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:34:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 15:34:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2018-10-15 15:34:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 15:34:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 566 transitions. [2018-10-15 15:34:31,965 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 566 transitions. Word has length 285 [2018-10-15 15:34:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:31,965 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 566 transitions. [2018-10-15 15:34:31,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 566 transitions. [2018-10-15 15:34:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-15 15:34:31,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:31,968 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:34:31,968 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:31,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash 148821887, now seen corresponding path program 1 times [2018-10-15 15:34:31,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-15 15:34:32,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:32,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:32,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:32,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:32,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:32,150 INFO L87 Difference]: Start difference. First operand 540 states and 566 transitions. Second operand 3 states. [2018-10-15 15:34:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:32,543 INFO L93 Difference]: Finished difference Result 651 states and 686 transitions. [2018-10-15 15:34:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:32,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2018-10-15 15:34:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:32,548 INFO L225 Difference]: With dead ends: 651 [2018-10-15 15:34:32,548 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 15:34:32,548 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:34:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 15:34:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2018-10-15 15:34:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2018-10-15 15:34:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 674 transitions. [2018-10-15 15:34:32,560 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 674 transitions. Word has length 311 [2018-10-15 15:34:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:32,560 INFO L481 AbstractCegarLoop]: Abstraction has 639 states and 674 transitions. [2018-10-15 15:34:32,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 674 transitions. [2018-10-15 15:34:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-15 15:34:32,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:32,563 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:32,564 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:32,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2002753912, now seen corresponding path program 1 times [2018-10-15 15:34:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-15 15:34:32,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:32,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:32,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:32,698 INFO L87 Difference]: Start difference. First operand 639 states and 674 transitions. Second operand 3 states. [2018-10-15 15:34:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:33,722 INFO L93 Difference]: Finished difference Result 783 states and 835 transitions. [2018-10-15 15:34:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:33,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2018-10-15 15:34:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:33,726 INFO L225 Difference]: With dead ends: 783 [2018-10-15 15:34:33,726 INFO L226 Difference]: Without dead ends: 777 [2018-10-15 15:34:33,727 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:34:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2018-10-15 15:34:33,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 765. [2018-10-15 15:34:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-10-15 15:34:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 817 transitions. [2018-10-15 15:34:33,741 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 817 transitions. Word has length 335 [2018-10-15 15:34:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:33,741 INFO L481 AbstractCegarLoop]: Abstraction has 765 states and 817 transitions. [2018-10-15 15:34:33,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 817 transitions. [2018-10-15 15:34:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-15 15:34:33,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:33,745 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:33,745 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:33,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1951426825, now seen corresponding path program 1 times [2018-10-15 15:34:33,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-15 15:34:33,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:33,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:33,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:33,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:33,916 INFO L87 Difference]: Start difference. First operand 765 states and 817 transitions. Second operand 3 states. [2018-10-15 15:34:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:34,241 INFO L93 Difference]: Finished difference Result 876 states and 931 transitions. [2018-10-15 15:34:34,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:34,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2018-10-15 15:34:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:34,255 INFO L225 Difference]: With dead ends: 876 [2018-10-15 15:34:34,255 INFO L226 Difference]: Without dead ends: 870 [2018-10-15 15:34:34,256 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:34:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-10-15 15:34:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 858. [2018-10-15 15:34:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-10-15 15:34:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 913 transitions. [2018-10-15 15:34:34,275 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 913 transitions. Word has length 371 [2018-10-15 15:34:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:34,275 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 913 transitions. [2018-10-15 15:34:34,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 913 transitions. [2018-10-15 15:34:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-15 15:34:34,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:34,280 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:34,280 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:34,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash -898762274, now seen corresponding path program 1 times [2018-10-15 15:34:34,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2018-10-15 15:34:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:34,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:34,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:34,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:34,502 INFO L87 Difference]: Start difference. First operand 858 states and 913 transitions. Second operand 3 states. [2018-10-15 15:34:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:35,124 INFO L93 Difference]: Finished difference Result 870 states and 922 transitions. [2018-10-15 15:34:35,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-10-15 15:34:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:35,129 INFO L225 Difference]: With dead ends: 870 [2018-10-15 15:34:35,129 INFO L226 Difference]: Without dead ends: 870 [2018-10-15 15:34:35,130 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:34:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-10-15 15:34:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 858. [2018-10-15 15:34:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-10-15 15:34:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 910 transitions. [2018-10-15 15:34:35,145 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 910 transitions. Word has length 413 [2018-10-15 15:34:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:35,146 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 910 transitions. [2018-10-15 15:34:35,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 910 transitions. [2018-10-15 15:34:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 15:34:35,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:35,150 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:35,150 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:35,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:35,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1748726395, now seen corresponding path program 1 times [2018-10-15 15:34:35,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-15 15:34:35,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:35,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:35,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:35,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:35,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:35,372 INFO L87 Difference]: Start difference. First operand 858 states and 910 transitions. Second operand 3 states. [2018-10-15 15:34:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:36,588 INFO L93 Difference]: Finished difference Result 969 states and 1021 transitions. [2018-10-15 15:34:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:36,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2018-10-15 15:34:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:36,593 INFO L225 Difference]: With dead ends: 969 [2018-10-15 15:34:36,593 INFO L226 Difference]: Without dead ends: 969 [2018-10-15 15:34:36,593 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:34:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-15 15:34:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 939. [2018-10-15 15:34:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-10-15 15:34:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 991 transitions. [2018-10-15 15:34:36,611 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 991 transitions. Word has length 433 [2018-10-15 15:34:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:36,612 INFO L481 AbstractCegarLoop]: Abstraction has 939 states and 991 transitions. [2018-10-15 15:34:36,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 991 transitions. [2018-10-15 15:34:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-15 15:34:36,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:36,617 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,618 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:36,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2102576092, now seen corresponding path program 1 times [2018-10-15 15:34:36,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 338 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-15 15:34:37,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:37,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:34:37,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:34:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:34:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:34:37,002 INFO L87 Difference]: Start difference. First operand 939 states and 991 transitions. Second operand 4 states. [2018-10-15 15:34:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:38,160 INFO L93 Difference]: Finished difference Result 1566 states and 1627 transitions. [2018-10-15 15:34:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:34:38,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 473 [2018-10-15 15:34:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:38,168 INFO L225 Difference]: With dead ends: 1566 [2018-10-15 15:34:38,168 INFO L226 Difference]: Without dead ends: 1473 [2018-10-15 15:34:38,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:34:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2018-10-15 15:34:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1155. [2018-10-15 15:34:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-15 15:34:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1207 transitions. [2018-10-15 15:34:38,190 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1207 transitions. Word has length 473 [2018-10-15 15:34:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:38,191 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1207 transitions. [2018-10-15 15:34:38,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:34:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1207 transitions. [2018-10-15 15:34:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-15 15:34:38,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:38,196 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:38,196 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:38,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:38,197 INFO L82 PathProgramCache]: Analyzing trace with hash 161770541, now seen corresponding path program 1 times [2018-10-15 15:34:38,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 415 proven. 6 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-15 15:34:38,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:38,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:34:38,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:34:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:34:38,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:34:38,517 INFO L87 Difference]: Start difference. First operand 1155 states and 1207 transitions. Second operand 4 states. [2018-10-15 15:34:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:38,862 INFO L93 Difference]: Finished difference Result 903 states and 935 transitions. [2018-10-15 15:34:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 15:34:38,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2018-10-15 15:34:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:38,863 INFO L225 Difference]: With dead ends: 903 [2018-10-15 15:34:38,863 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 15:34:38,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:34:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 15:34:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 15:34:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 15:34:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 15:34:38,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 497 [2018-10-15 15:34:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:38,865 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 15:34:38,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:34:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 15:34:38,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 15:34:38,871 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:38 BasicIcfg [2018-10-15 15:34:38,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:34:38,872 INFO L168 Benchmark]: Toolchain (without parser) took 12395.67 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.2 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 128.7 MB). Peak memory consumption was 401.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:38,874 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:34:38,875 INFO L168 Benchmark]: Boogie Preprocessor took 94.63 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:34:38,875 INFO L168 Benchmark]: RCFGBuilder took 1269.17 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:38,876 INFO L168 Benchmark]: IcfgTransformer took 36.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:34:38,877 INFO L168 Benchmark]: TraceAbstraction took 10990.20 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 75.8 MB). Peak memory consumption was 349.0 MB. Max. memory is 7.1 GB. [2018-10-15 15:34:38,881 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.23 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 94.63 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 1269.17 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 36.68 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * TraceAbstraction took 10990.20 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 273.2 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 75.8 MB). Peak memory consumption was 349.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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, 284 locations, 1 error locations. SAFE Result, 10.9s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3983 SDtfs, 952 SDslu, 3346 SDs, 0 SdLazy, 1018 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1155occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 411 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4152 NumberOfCodeBlocks, 4152 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1682077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 4685/4710 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/s3_clnt_1.cil.c_16.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-34-38-894.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-34-38-894.csv Received shutdown request...