./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 595902ef9b99aff9bcc31a52a77391ef5dbaa4b7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:22:39,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:22:39,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:22:39,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:22:39,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:22:39,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:22:39,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:22:39,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:22:39,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:22:39,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:22:39,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:22:39,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:22:39,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:22:39,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:22:39,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:22:39,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:22:39,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:22:39,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:22:39,595 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:22:39,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:22:39,601 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:22:39,605 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:22:39,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:22:39,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:22:39,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:22:39,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:22:39,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:22:39,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:22:39,619 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:22:39,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:22:39,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:22:39,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:22:39,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:22:39,624 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:22:39,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:22:39,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:22:39,626 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:22:39,646 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:22:39,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:22:39,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:22:39,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:22:39,648 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:22:39,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:22:39,648 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:22:39,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:22:39,650 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:22:39,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:22:39,650 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:22:39,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:22:39,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:22:39,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:22:39,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:22:39,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:22:39,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:22:39,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:22:39,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 595902ef9b99aff9bcc31a52a77391ef5dbaa4b7 [2019-01-12 11:22:39,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:22:39,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:22:39,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:22:39,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:22:39,735 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:22:39,736 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2019-01-12 11:22:39,801 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4564cfd29/3d3019f32a464e5388cce6bda5a93c98/FLAGb2f3d5b4c [2019-01-12 11:22:40,366 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:22:40,367 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2019-01-12 11:22:40,386 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4564cfd29/3d3019f32a464e5388cce6bda5a93c98/FLAGb2f3d5b4c [2019-01-12 11:22:40,623 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4564cfd29/3d3019f32a464e5388cce6bda5a93c98 [2019-01-12 11:22:40,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:22:40,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:22:40,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:40,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:22:40,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:22:40,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:40" (1/1) ... [2019-01-12 11:22:40,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5089c550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:40, skipping insertion in model container [2019-01-12 11:22:40,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:40" (1/1) ... [2019-01-12 11:22:40,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:22:40,713 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:22:41,209 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:41,218 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:22:41,438 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:41,454 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:22:41,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41 WrapperNode [2019-01-12 11:22:41,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:41,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:41,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:22:41,456 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:22:41,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:41,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:22:41,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:22:41,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:22:41,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (1/1) ... [2019-01-12 11:22:41,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:22:41,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:22:41,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:22:41,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:22:41,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:22:41,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:22:41,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:22:44,832 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:22:44,833 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:22:44,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:44 BoogieIcfgContainer [2019-01-12 11:22:44,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:22:44,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:22:44,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:22:44,838 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:22:44,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:22:40" (1/3) ... [2019-01-12 11:22:44,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc50e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:44, skipping insertion in model container [2019-01-12 11:22:44,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:41" (2/3) ... [2019-01-12 11:22:44,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc50e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:44, skipping insertion in model container [2019-01-12 11:22:44,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:44" (3/3) ... [2019-01-12 11:22:44,842 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+nlh-reducer.c [2019-01-12 11:22:44,852 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:22:44,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-12 11:22:44,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-12 11:22:44,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:22:44,913 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:22:44,913 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:22:44,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:22:44,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:22:44,914 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:22:44,915 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:22:44,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:22:44,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:22:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-01-12 11:22:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:22:44,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:44,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:44,952 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-01-12 11:22:44,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:44,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:44,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:44,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:44,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:45,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:45,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:22:45,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:22:45,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:22:45,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:22:45,200 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 4 states. [2019-01-12 11:22:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:46,718 INFO L93 Difference]: Finished difference Result 315 states and 573 transitions. [2019-01-12 11:22:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:22:46,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-12 11:22:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:46,736 INFO L225 Difference]: With dead ends: 315 [2019-01-12 11:22:46,736 INFO L226 Difference]: Without dead ends: 298 [2019-01-12 11:22:46,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-12 11:22:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-01-12 11:22:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-01-12 11:22:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 421 transitions. [2019-01-12 11:22:46,807 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 421 transitions. Word has length 7 [2019-01-12 11:22:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 421 transitions. [2019-01-12 11:22:46,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:22:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 421 transitions. [2019-01-12 11:22:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:22:46,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:46,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:46,810 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-01-12 11:22:46,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:46,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:46,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:46,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:46,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:46,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:46,938 INFO L87 Difference]: Start difference. First operand 298 states and 421 transitions. Second operand 6 states. [2019-01-12 11:22:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:48,954 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2019-01-12 11:22:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:48,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-12 11:22:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:48,960 INFO L225 Difference]: With dead ends: 305 [2019-01-12 11:22:48,960 INFO L226 Difference]: Without dead ends: 300 [2019-01-12 11:22:48,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:48,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-12 11:22:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2019-01-12 11:22:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-12 11:22:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2019-01-12 11:22:48,984 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 8 [2019-01-12 11:22:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2019-01-12 11:22:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2019-01-12 11:22:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-12 11:22:48,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:48,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:48,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 137513629, now seen corresponding path program 1 times [2019-01-12 11:22:48,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:48,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:48,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:49,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:49,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:22:49,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:22:49,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:22:49,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:22:49,048 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand 4 states. [2019-01-12 11:22:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:49,694 INFO L93 Difference]: Finished difference Result 293 states and 356 transitions. [2019-01-12 11:22:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:22:49,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-12 11:22:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:49,697 INFO L225 Difference]: With dead ends: 293 [2019-01-12 11:22:49,697 INFO L226 Difference]: Without dead ends: 291 [2019-01-12 11:22:49,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-01-12 11:22:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-01-12 11:22:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-12 11:22:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2019-01-12 11:22:49,714 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 8 [2019-01-12 11:22:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:49,714 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2019-01-12 11:22:49,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:22:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2019-01-12 11:22:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:22:49,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:49,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:49,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:49,718 INFO L82 PathProgramCache]: Analyzing trace with hash -32040723, now seen corresponding path program 1 times [2019-01-12 11:22:49,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:49,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:49,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:49,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:49,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:49,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:49,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:49,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:49,792 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand 5 states. [2019-01-12 11:22:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:51,367 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2019-01-12 11:22:51,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:51,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 11:22:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:51,371 INFO L225 Difference]: With dead ends: 296 [2019-01-12 11:22:51,371 INFO L226 Difference]: Without dead ends: 294 [2019-01-12 11:22:51,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-12 11:22:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-01-12 11:22:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-12 11:22:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2019-01-12 11:22:51,384 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 9 [2019-01-12 11:22:51,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:51,384 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2019-01-12 11:22:51,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2019-01-12 11:22:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:22:51,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:51,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:51,386 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -726236111, now seen corresponding path program 1 times [2019-01-12 11:22:51,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:51,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:51,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:51,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:51,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:51,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:51,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:51,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:51,483 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand 6 states. [2019-01-12 11:22:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:52,513 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2019-01-12 11:22:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:52,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:22:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:52,516 INFO L225 Difference]: With dead ends: 294 [2019-01-12 11:22:52,516 INFO L226 Difference]: Without dead ends: 292 [2019-01-12 11:22:52,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-01-12 11:22:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-01-12 11:22:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-12 11:22:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2019-01-12 11:22:52,527 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 11 [2019-01-12 11:22:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:52,527 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2019-01-12 11:22:52,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2019-01-12 11:22:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:22:52,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:52,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:52,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1038478869, now seen corresponding path program 1 times [2019-01-12 11:22:52,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:52,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:52,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:52,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:52,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:52,624 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand 6 states. [2019-01-12 11:22:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:53,695 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2019-01-12 11:22:53,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:53,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:22:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:53,699 INFO L225 Difference]: With dead ends: 292 [2019-01-12 11:22:53,699 INFO L226 Difference]: Without dead ends: 288 [2019-01-12 11:22:53,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:22:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-12 11:22:53,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-01-12 11:22:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-12 11:22:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2019-01-12 11:22:53,708 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 12 [2019-01-12 11:22:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:53,709 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2019-01-12 11:22:53,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2019-01-12 11:22:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:22:53,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:53,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:53,710 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash -242777879, now seen corresponding path program 1 times [2019-01-12 11:22:53,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:53,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:53,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:53,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:53,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:53,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:53,869 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand 8 states. [2019-01-12 11:22:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:55,157 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2019-01-12 11:22:55,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:55,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-12 11:22:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:55,161 INFO L225 Difference]: With dead ends: 288 [2019-01-12 11:22:55,161 INFO L226 Difference]: Without dead ends: 286 [2019-01-12 11:22:55,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:22:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-12 11:22:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-01-12 11:22:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-12 11:22:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 346 transitions. [2019-01-12 11:22:55,169 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 346 transitions. Word has length 13 [2019-01-12 11:22:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:55,170 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 346 transitions. [2019-01-12 11:22:55,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 346 transitions. [2019-01-12 11:22:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:22:55,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:55,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:55,173 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2112927996, now seen corresponding path program 1 times [2019-01-12 11:22:55,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:55,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:55,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:55,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:55,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:55,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:55,257 INFO L87 Difference]: Start difference. First operand 283 states and 346 transitions. Second operand 6 states. [2019-01-12 11:22:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:56,242 INFO L93 Difference]: Finished difference Result 303 states and 368 transitions. [2019-01-12 11:22:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:56,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:22:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:56,245 INFO L225 Difference]: With dead ends: 303 [2019-01-12 11:22:56,246 INFO L226 Difference]: Without dead ends: 301 [2019-01-12 11:22:56,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-01-12 11:22:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 281. [2019-01-12 11:22:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-12 11:22:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 344 transitions. [2019-01-12 11:22:56,255 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 344 transitions. Word has length 13 [2019-01-12 11:22:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:56,255 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 344 transitions. [2019-01-12 11:22:56,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 344 transitions. [2019-01-12 11:22:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:22:56,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:56,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:56,257 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2111204092, now seen corresponding path program 1 times [2019-01-12 11:22:56,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:56,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:56,388 INFO L87 Difference]: Start difference. First operand 281 states and 344 transitions. Second operand 6 states. [2019-01-12 11:22:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:57,256 INFO L93 Difference]: Finished difference Result 284 states and 347 transitions. [2019-01-12 11:22:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:57,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-01-12 11:22:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:57,259 INFO L225 Difference]: With dead ends: 284 [2019-01-12 11:22:57,259 INFO L226 Difference]: Without dead ends: 282 [2019-01-12 11:22:57,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-12 11:22:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2019-01-12 11:22:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-01-12 11:22:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 342 transitions. [2019-01-12 11:22:57,268 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 342 transitions. Word has length 13 [2019-01-12 11:22:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:57,268 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 342 transitions. [2019-01-12 11:22:57,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 342 transitions. [2019-01-12 11:22:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:57,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:57,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:57,272 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1076254322, now seen corresponding path program 1 times [2019-01-12 11:22:57,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:57,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:57,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:57,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:22:57,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:22:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:22:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:57,416 INFO L87 Difference]: Start difference. First operand 279 states and 342 transitions. Second operand 8 states. [2019-01-12 11:22:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:58,529 INFO L93 Difference]: Finished difference Result 295 states and 360 transitions. [2019-01-12 11:22:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:58,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:22:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:58,532 INFO L225 Difference]: With dead ends: 295 [2019-01-12 11:22:58,532 INFO L226 Difference]: Without dead ends: 293 [2019-01-12 11:22:58,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:22:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-12 11:22:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 277. [2019-01-12 11:22:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-12 11:22:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 340 transitions. [2019-01-12 11:22:58,543 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 340 transitions. Word has length 14 [2019-01-12 11:22:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:58,543 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 340 transitions. [2019-01-12 11:22:58,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:22:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 340 transitions. [2019-01-12 11:22:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:58,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:58,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:58,545 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1074707177, now seen corresponding path program 1 times [2019-01-12 11:22:58,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:58,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:58,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:58,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:58,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:22:58,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:58,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:58,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:58,632 INFO L87 Difference]: Start difference. First operand 277 states and 340 transitions. Second operand 6 states. [2019-01-12 11:22:58,934 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-12 11:22:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:59,913 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2019-01-12 11:22:59,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:59,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 11:22:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:59,917 INFO L225 Difference]: With dead ends: 298 [2019-01-12 11:22:59,917 INFO L226 Difference]: Without dead ends: 296 [2019-01-12 11:22:59,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-01-12 11:22:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 275. [2019-01-12 11:22:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-01-12 11:22:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 338 transitions. [2019-01-12 11:22:59,926 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 338 transitions. Word has length 14 [2019-01-12 11:22:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:59,926 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 338 transitions. [2019-01-12 11:22:59,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 338 transitions. [2019-01-12 11:22:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:22:59,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:59,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:59,929 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1022813242, now seen corresponding path program 1 times [2019-01-12 11:22:59,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:59,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:59,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:00,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:00,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:00,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:00,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:00,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:00,049 INFO L87 Difference]: Start difference. First operand 275 states and 338 transitions. Second operand 8 states. [2019-01-12 11:23:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:02,374 INFO L93 Difference]: Finished difference Result 275 states and 338 transitions. [2019-01-12 11:23:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:02,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 11:23:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:02,378 INFO L225 Difference]: With dead ends: 275 [2019-01-12 11:23:02,378 INFO L226 Difference]: Without dead ends: 271 [2019-01-12 11:23:02,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:23:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-01-12 11:23:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-01-12 11:23:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-12 11:23:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 334 transitions. [2019-01-12 11:23:02,387 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 334 transitions. Word has length 14 [2019-01-12 11:23:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:02,387 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 334 transitions. [2019-01-12 11:23:02,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 334 transitions. [2019-01-12 11:23:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:23:02,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:02,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:02,391 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1043820030, now seen corresponding path program 1 times [2019-01-12 11:23:02,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:02,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:02,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:02,684 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-12 11:23:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:02,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:02,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:02,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:02,833 INFO L87 Difference]: Start difference. First operand 271 states and 334 transitions. Second operand 8 states. [2019-01-12 11:23:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:03,869 INFO L93 Difference]: Finished difference Result 286 states and 351 transitions. [2019-01-12 11:23:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:03,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 11:23:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:03,873 INFO L225 Difference]: With dead ends: 286 [2019-01-12 11:23:03,873 INFO L226 Difference]: Without dead ends: 284 [2019-01-12 11:23:03,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:23:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-12 11:23:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 269. [2019-01-12 11:23:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-12 11:23:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2019-01-12 11:23:03,881 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 15 [2019-01-12 11:23:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:03,881 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2019-01-12 11:23:03,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2019-01-12 11:23:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:23:03,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:03,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:03,882 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 806842801, now seen corresponding path program 1 times [2019-01-12 11:23:03,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:03,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:03,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:03,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:03,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:03,960 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand 7 states. [2019-01-12 11:23:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:04,856 INFO L93 Difference]: Finished difference Result 272 states and 335 transitions. [2019-01-12 11:23:04,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:04,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-12 11:23:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:04,859 INFO L225 Difference]: With dead ends: 272 [2019-01-12 11:23:04,860 INFO L226 Difference]: Without dead ends: 270 [2019-01-12 11:23:04,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-12 11:23:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-12 11:23:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-12 11:23:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-01-12 11:23:04,868 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 16 [2019-01-12 11:23:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:04,868 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-01-12 11:23:04,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-01-12 11:23:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 11:23:04,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:04,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:04,869 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash -757672814, now seen corresponding path program 1 times [2019-01-12 11:23:04,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:04,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:04,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:04,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:04,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:04,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:23:04,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:23:04,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:23:04,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:23:04,943 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 6 states. [2019-01-12 11:23:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:05,829 INFO L93 Difference]: Finished difference Result 270 states and 333 transitions. [2019-01-12 11:23:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:23:05,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-12 11:23:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:05,832 INFO L225 Difference]: With dead ends: 270 [2019-01-12 11:23:05,832 INFO L226 Difference]: Without dead ends: 250 [2019-01-12 11:23:05,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-12 11:23:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-01-12 11:23:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-12 11:23:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-01-12 11:23:05,846 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 17 [2019-01-12 11:23:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:05,847 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-01-12 11:23:05,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:23:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-01-12 11:23:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-12 11:23:05,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:05,855 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:05,855 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:05,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash -707619029, now seen corresponding path program 1 times [2019-01-12 11:23:05,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:05,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:06,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:06,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:23:06,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:23:06,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:23:06,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:23:06,246 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 7 states. [2019-01-12 11:23:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:06,869 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-12 11:23:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:23:06,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2019-01-12 11:23:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:06,873 INFO L225 Difference]: With dead ends: 251 [2019-01-12 11:23:06,874 INFO L226 Difference]: Without dead ends: 249 [2019-01-12 11:23:06,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:23:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-12 11:23:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-01-12 11:23:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-12 11:23:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2019-01-12 11:23:06,879 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2019-01-12 11:23:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:06,880 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2019-01-12 11:23:06,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:23:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2019-01-12 11:23:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-12 11:23:06,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:23:06,884 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:23:06,884 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:23:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:23:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -461348049, now seen corresponding path program 1 times [2019-01-12 11:23:06,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:23:06,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:23:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:06,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:23:06,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:23:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:23:07,726 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 11:23:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:23:07,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:23:07,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 11:23:07,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 11:23:07,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 11:23:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:23:07,768 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 8 states. [2019-01-12 11:23:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:23:08,601 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-12 11:23:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:23:08,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-01-12 11:23:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:23:08,604 INFO L225 Difference]: With dead ends: 250 [2019-01-12 11:23:08,604 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:23:08,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-12 11:23:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:23:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:23:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:23:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:23:08,607 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2019-01-12 11:23:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:23:08,607 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:23:08,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 11:23:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:23:08,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:23:08,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:23:08,860 INFO L448 ceAbstractionStarter]: For program point L1753(lines 1753 2769) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L630(lines 630 2942) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L451 ceAbstractionStarter]: At program point L2612(lines 11 3003) the Hoare annotation is: true [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L564(lines 564 2952) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L2018(lines 2018 2728) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 2901) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 2860) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L2151(lines 2151 2708) no Hoare annotation was computed. [2019-01-12 11:23:08,861 INFO L448 ceAbstractionStarter]: For program point L2085(lines 2085 2718) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2667) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 2992) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L1293(lines 1293 2840) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 2850) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L1558(lines 1558 2799) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 2972) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 2982) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L1823(lines 1823 2758) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 2931) no Hoare annotation was computed. [2019-01-12 11:23:08,862 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 50) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L965(lines 965 2890) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 2738) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L1890(lines 1890 2748) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L2221(lines 2221 2697) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 2870) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L1032(lines 1032 2880) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L2618(lines 2618 2637) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L2486(lines 2486 2656) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L1363(lines 1363 2829) no Hoare annotation was computed. [2019-01-12 11:23:08,863 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 2788) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L505(lines 505 2961) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L2553(lines 2553 2646) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 276) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L770(lines 770 2920) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L1761(lines 1761 2768) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L1695(lines 1695 2778) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L444 ceAbstractionStarter]: At program point L2620(lines 20 2997) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L2026(lines 2026 2727) no Hoare annotation was computed. [2019-01-12 11:23:08,864 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 2900) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 2910) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L2291(lines 2291 2686) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 2859) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L1433(lines 1433 2818) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L2424(lines 2424 2666) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L2358(lines 2358 2676) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 2991) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 11:23:08,865 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 2950) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 2798) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L1500(lines 1500 2808) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L1831(lines 1831 2757) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L708(lines 708 2930) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 2940) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L2096(lines 2096 2716) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 2889) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L1238(lines 1238 2848) no Hoare annotation was computed. [2019-01-12 11:23:08,866 INFO L448 ceAbstractionStarter]: For program point L2229(lines 2229 2696) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2706) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L2626(lines 2626 2636) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L2494(lines 2494 2655) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 2980) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 2828) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 2838) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 270) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L1636(lines 1636 2787) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 2960) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L447(lines 447 2970) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L1901(lines 1901 2746) no Hoare annotation was computed. [2019-01-12 11:23:08,867 INFO L448 ceAbstractionStarter]: For program point L778(lines 778 2919) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 262) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L1043(lines 1043 2878) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L2034(lines 2034 2726) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L1968(lines 1968 2736) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L444 ceAbstractionStarter]: At program point L2629(lines 59 2996) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__tagbuf_len~0 ULTIMATE.start_main_~main__t~0)) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L2299(lines 2299 2685) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L1176(lines 1176 2858) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L1110(lines 1110 2868) no Hoare annotation was computed. [2019-01-12 11:23:08,868 INFO L448 ceAbstractionStarter]: For program point L2564(lines 2564 2644) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L1441(lines 1441 2817) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 2990) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 2776) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 2949) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 2908) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L1839(lines 1839 2756) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L1773(lines 1773 2766) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2599) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L2104(lines 2104 2715) no Hoare annotation was computed. [2019-01-12 11:23:08,869 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 2888) no Hoare annotation was computed. [2019-01-12 11:23:08,870 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 2898) no Hoare annotation was computed. [2019-01-12 11:23:08,875 INFO L448 ceAbstractionStarter]: For program point L2369(lines 2369 2674) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L1246(lines 1246 2847) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 2806) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2654) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L2436(lines 2436 2664) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 2979) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 2938) no Hoare annotation was computed. [2019-01-12 11:23:08,876 INFO L448 ceAbstractionStarter]: For program point L1644(lines 1644 2786) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L1578(lines 1578 2796) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L444 ceAbstractionStarter]: At program point L2635(lines 2586 2642) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__tagbuf_len~0 ULTIMATE.start_main_~main__t~0)) (<= 1 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 1)) [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 2996) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L1909(lines 1909 2745) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 2918) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L720(lines 720 2928) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L2174(lines 2174 2704) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L1051(lines 1051 2877) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L1316(lines 1316 2836) no Hoare annotation was computed. [2019-01-12 11:23:08,877 INFO L448 ceAbstractionStarter]: For program point L2307(lines 2307 2684) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L2241(lines 2241 2694) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 277) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L2572(lines 2572 2643) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 2968) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 2816) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L1383(lines 1383 2826) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2611) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 268) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L1714(lines 1714 2775) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 2948) no Hoare annotation was computed. [2019-01-12 11:23:08,878 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 2958) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L1979(lines 1979 2734) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L856(lines 856 2907) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L262(line 262) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L1121(lines 1121 2866) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L2112(lines 2112 2714) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L2046(lines 2046 2724) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L2377(lines 2377 2673) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L1254(lines 1254 2846) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L1188(lines 1188 2856) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 235) no Hoare annotation was computed. [2019-01-12 11:23:08,879 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:23:08,880 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-01-12 11:23:08,880 INFO L448 ceAbstractionStarter]: For program point L1519(lines 1519 2805) no Hoare annotation was computed. [2019-01-12 11:23:08,884 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 2978) no Hoare annotation was computed. [2019-01-12 11:23:08,884 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 2988) no Hoare annotation was computed. [2019-01-12 11:23:08,884 INFO L448 ceAbstractionStarter]: For program point L1784(lines 1784 2764) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 2937) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 2896) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L1917(lines 1917 2744) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L1851(lines 1851 2754) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 224) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L2182(lines 2182 2703) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L1059(lines 1059 2876) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 2886) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L2447(lines 2447 2662) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L1324(lines 1324 2835) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 281) no Hoare annotation was computed. [2019-01-12 11:23:08,885 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 2794) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L2580(lines 2580 2642) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2652) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L466(lines 466 2967) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 2926) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 2774) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L1656(lines 1656 2784) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L1987(lines 1987 2733) no Hoare annotation was computed. [2019-01-12 11:23:08,886 INFO L448 ceAbstractionStarter]: For program point L864(lines 864 2906) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L798(lines 798 2916) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L2252(lines 2252 2692) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 229) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L1129(lines 1129 2865) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 2824) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L2385(lines 2385 2672) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L2319(lines 2319 2682) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 2956) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 2804) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 2814) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 11:23:08,887 INFO L448 ceAbstractionStarter]: For program point L1792(lines 1792 2763) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L669(lines 669 2936) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 2946) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2722) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L934(lines 934 2895) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L1199(lines 1199 2854) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L2190(lines 2190 2702) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L2124(lines 2124 2712) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L2455(lines 2455 2661) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 2986) no Hoare annotation was computed. [2019-01-12 11:23:08,888 INFO L448 ceAbstractionStarter]: For program point L1332(lines 1332 2834) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L444 ceAbstractionStarter]: At program point L275(lines 127 277) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (not (= ULTIMATE.start_main_~main__tagbuf_len~0 ULTIMATE.start_main_~main__t~0)) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 0))) [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1266(lines 1266 2844) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1597(lines 1597 2793) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 2966) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 2976) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1862(lines 1862 2752) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L739(lines 739 2925) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 2884) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1995(lines 1995 2732) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point L1929(lines 1929 2742) no Hoare annotation was computed. [2019-01-12 11:23:08,889 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L2260(lines 2260 2691) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 222) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 2864) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L1071(lines 1071 2874) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L2525(lines 2525 2650) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 2823) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 279) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L1667(lines 1667 2782) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L544(lines 544 2955) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 3002) no Hoare annotation was computed. [2019-01-12 11:23:08,890 INFO L448 ceAbstractionStarter]: For program point L809(lines 809 2914) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L1800(lines 1800 2762) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L1734(lines 1734 2772) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L2065(lines 2065 2721) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 2894) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 2904) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L2330(lines 2330 2680) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L1207(lines 1207 2853) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 227) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 2812) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L2463(lines 2463 2660) no Hoare annotation was computed. [2019-01-12 11:23:08,891 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 2985) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L2397(lines 2397 2670) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 2944) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L1605(lines 1605 2792) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L1539(lines 1539 2802) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 2997) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L1870(lines 1870 2751) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 2924) no Hoare annotation was computed. [2019-01-12 11:23:08,892 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 2934) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2597(lines 2597 2640) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2135(lines 2135 2710) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 2883) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 2842) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2268(lines 2268 2690) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2202(lines 2202 2700) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2599(line 2599) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L2533(lines 2533 2649) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 2974) no Hoare annotation was computed. [2019-01-12 11:23:08,893 INFO L448 ceAbstractionStarter]: For program point L1410(lines 1410 2822) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 2832) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L444 ceAbstractionStarter]: At program point L221(lines 87 279) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 0))) [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L1675(lines 1675 2781) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 2954) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 2964) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L1940(lines 1940 2740) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 2913) no Hoare annotation was computed. [2019-01-12 11:23:08,894 INFO L448 ceAbstractionStarter]: For program point L1082(lines 1082 2872) no Hoare annotation was computed. [2019-01-12 11:23:08,895 INFO L448 ceAbstractionStarter]: For program point L2073(lines 2073 2720) no Hoare annotation was computed. [2019-01-12 11:23:08,897 INFO L448 ceAbstractionStarter]: For program point L2007(lines 2007 2730) no Hoare annotation was computed. [2019-01-12 11:23:08,897 INFO L448 ceAbstractionStarter]: For program point L2338(lines 2338 2679) no Hoare annotation was computed. [2019-01-12 11:23:08,897 INFO L448 ceAbstractionStarter]: For program point L1215(lines 1215 2852) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 2862) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L1480(lines 1480 2811) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 2984) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 2994) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 226) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L1745(lines 1745 2770) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 2943) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 52) no Hoare annotation was computed. [2019-01-12 11:23:08,898 INFO L451 ceAbstractionStarter]: At program point L3001(lines 16 3002) the Hoare annotation is: true [2019-01-12 11:23:08,898 INFO L448 ceAbstractionStarter]: For program point L887(lines 887 2902) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L1878(lines 1878 2750) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L1812(lines 1812 2760) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L2143(lines 2143 2709) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L1020(lines 1020 2882) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 2892) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L2408(lines 2408 2668) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L1285(lines 1285 2841) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L1550(lines 1550 2800) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L2541(lines 2541 2648) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 2973) no Hoare annotation was computed. [2019-01-12 11:23:08,899 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2658) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 2932) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L1683(lines 1683 2780) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L1617(lines 1617 2790) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L1948(lines 1948 2739) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 2912) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L759(lines 759 2922) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L2609(lines 2609 2638) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L2213(lines 2213 2698) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L1090(lines 1090 2871) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L1355(lines 1355 2830) no Hoare annotation was computed. [2019-01-12 11:23:08,900 INFO L448 ceAbstractionStarter]: For program point L2346(lines 2346 2678) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L2280(lines 2280 2688) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L2611(line 2611) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 2962) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 2810) no Hoare annotation was computed. [2019-01-12 11:23:08,901 INFO L448 ceAbstractionStarter]: For program point L1422(lines 1422 2820) no Hoare annotation was computed. [2019-01-12 11:23:08,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:23:08 BoogieIcfgContainer [2019-01-12 11:23:08,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:23:08,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:23:08,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:23:08,945 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:23:08,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:44" (3/4) ... [2019-01-12 11:23:08,952 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:23:08,993 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:23:08,997 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:23:09,227 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:23:09,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:23:09,229 INFO L168 Benchmark]: Toolchain (without parser) took 28603.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 264.0 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,230 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:23:09,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 260.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 904.4 MB in the beginning and 1.1 GB in the end (delta: -228.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,231 INFO L168 Benchmark]: Boogie Preprocessor took 126.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:23:09,232 INFO L168 Benchmark]: RCFGBuilder took 2991.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.9 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,232 INFO L168 Benchmark]: TraceAbstraction took 24108.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,232 INFO L168 Benchmark]: Witness Printer took 283.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:23:09,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 827.71 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 260.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 904.4 MB in the beginning and 1.1 GB in the end (delta: -228.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2991.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.9 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24108.80 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -149.5 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * Witness Printer took 283.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 262]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2611]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 == __VERIFIER_assert__cond) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && __VERIFIER_assert__cond == 1) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 304 locations, 16 error locations. SAFE Result, 23.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1748 SDtfs, 9688 SDslu, 3005 SDs, 0 SdLazy, 13474 SolverSat, 2473 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 89 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 67 HoareAnnotationTreeSize, 7 FomulaSimplifications, 2864 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 240 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 656 ConstructedInterpolants, 0 QuantifiedInterpolants, 137469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...