java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 09:39:28,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 09:39:28,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 09:39:28,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 09:39:28,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 09:39:28,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 09:39:28,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 09:39:28,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 09:39:28,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 09:39:28,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 09:39:28,846 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 09:39:28,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 09:39:28,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 09:39:28,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 09:39:28,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 09:39:28,850 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 09:39:28,851 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 09:39:28,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 09:39:28,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 09:39:28,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 09:39:28,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 09:39:28,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 09:39:28,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 09:39:28,862 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 09:39:28,862 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 09:39:28,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 09:39:28,864 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 09:39:28,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 09:39:28,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 09:39:28,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 09:39:28,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 09:39:28,868 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 09:39:28,868 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 09:39:28,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 09:39:28,869 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 09:39:28,870 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 09:39:28,870 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 09:39:28,885 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 09:39:28,885 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 09:39:28,886 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 09:39:28,886 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 09:39:28,886 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 09:39:28,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 09:39:28,887 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 09:39:28,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 09:39:28,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 09:39:28,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 09:39:28,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 09:39:28,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 09:39:28,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 09:39:28,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 09:39:28,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 09:39:28,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 09:39:28,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 09:39:28,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 09:39:28,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 09:39:28,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 09:39:28,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 09:39:28,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 09:39:28,890 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 09:39:28,890 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 09:39:28,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 09:39:28,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 09:39:28,891 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 09:39:28,891 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 09:39:28,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 09:39:28,954 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 09:39:28,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 09:39:28,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 09:39:28,961 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 09:39:28,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-10-23 09:39:29,024 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/426cc134d/f69928f5ffbb41c68fb956f97739d615/FLAG1f30b69a5 [2018-10-23 09:39:29,480 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 09:39:29,481 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-10-23 09:39:29,495 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/426cc134d/f69928f5ffbb41c68fb956f97739d615/FLAG1f30b69a5 [2018-10-23 09:39:29,511 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/426cc134d/f69928f5ffbb41c68fb956f97739d615 [2018-10-23 09:39:29,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 09:39:29,523 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 09:39:29,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:29,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 09:39:29,529 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 09:39:29,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:29" (1/1) ... [2018-10-23 09:39:29,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9badf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:29, skipping insertion in model container [2018-10-23 09:39:29,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:39:29" (1/1) ... [2018-10-23 09:39:29,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 09:39:29,597 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 09:39:29,931 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:29,942 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 09:39:30,043 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 09:39:30,059 INFO L193 MainTranslator]: Completed translation [2018-10-23 09:39:30,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30 WrapperNode [2018-10-23 09:39:30,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 09:39:30,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:30,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 09:39:30,061 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 09:39:30,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 09:39:30,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 09:39:30,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 09:39:30,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 09:39:30,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... [2018-10-23 09:39:30,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 09:39:30,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 09:39:30,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 09:39:30,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 09:39:30,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 09:39:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 09:39:30,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 09:39:31,416 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 09:39:31,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:31 BoogieIcfgContainer [2018-10-23 09:39:31,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 09:39:31,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 09:39:31,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 09:39:31,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 09:39:31,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:39:29" (1/3) ... [2018-10-23 09:39:31,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d01c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:31, skipping insertion in model container [2018-10-23 09:39:31,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:39:30" (2/3) ... [2018-10-23 09:39:31,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d01c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:39:31, skipping insertion in model container [2018-10-23 09:39:31,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:39:31" (3/3) ... [2018-10-23 09:39:31,423 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.p+lhb-reducer.c [2018-10-23 09:39:31,433 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 09:39:31,442 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-10-23 09:39:31,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-10-23 09:39:31,494 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 09:39:31,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 09:39:31,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 09:39:31,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 09:39:31,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 09:39:31,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 09:39:31,496 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 09:39:31,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 09:39:31,497 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 09:39:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-10-23 09:39:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-23 09:39:31,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:31,526 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:31,528 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:31,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2018-10-23 09:39:31,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:31,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:31,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 09:39:31,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 09:39:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 09:39:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-23 09:39:31,761 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2018-10-23 09:39:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:32,786 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2018-10-23 09:39:32,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 09:39:32,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-10-23 09:39:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:32,801 INFO L225 Difference]: With dead ends: 131 [2018-10-23 09:39:32,801 INFO L226 Difference]: Without dead ends: 114 [2018-10-23 09:39:32,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 09:39:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-23 09:39:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-10-23 09:39:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-23 09:39:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2018-10-23 09:39:32,856 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2018-10-23 09:39:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:32,856 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2018-10-23 09:39:32,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 09:39:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-10-23 09:39:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-23 09:39:32,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:32,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:32,858 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:32,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:32,858 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2018-10-23 09:39:32,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:32,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:32,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:32,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:32,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:32,949 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 6 states. [2018-10-23 09:39:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:33,651 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-10-23 09:39:33,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:33,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-10-23 09:39:33,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:33,654 INFO L225 Difference]: With dead ends: 114 [2018-10-23 09:39:33,655 INFO L226 Difference]: Without dead ends: 109 [2018-10-23 09:39:33,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-23 09:39:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-23 09:39:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-23 09:39:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2018-10-23 09:39:33,666 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2018-10-23 09:39:33,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:33,666 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2018-10-23 09:39:33,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:33,667 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-10-23 09:39:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-23 09:39:33,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:33,668 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:33,668 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:33,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2018-10-23 09:39:33,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:33,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:33,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:33,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:33,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:33,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:33,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:33,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:33,758 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 6 states. [2018-10-23 09:39:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:34,202 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2018-10-23 09:39:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:34,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-23 09:39:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:34,208 INFO L225 Difference]: With dead ends: 144 [2018-10-23 09:39:34,208 INFO L226 Difference]: Without dead ends: 142 [2018-10-23 09:39:34,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-23 09:39:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2018-10-23 09:39:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-23 09:39:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-10-23 09:39:34,221 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2018-10-23 09:39:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:34,222 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-10-23 09:39:34,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-10-23 09:39:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 09:39:34,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:34,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:34,225 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:34,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2018-10-23 09:39:34,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:34,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:34,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:34,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:34,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:34,318 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2018-10-23 09:39:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:34,980 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-10-23 09:39:34,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:34,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-10-23 09:39:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:34,983 INFO L225 Difference]: With dead ends: 140 [2018-10-23 09:39:34,984 INFO L226 Difference]: Without dead ends: 134 [2018-10-23 09:39:34,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-23 09:39:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 103. [2018-10-23 09:39:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-23 09:39:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-10-23 09:39:34,992 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2018-10-23 09:39:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:34,992 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-10-23 09:39:34,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-10-23 09:39:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:34,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:34,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:34,994 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:34,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:34,995 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2018-10-23 09:39:34,995 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:34,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:34,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:34,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:34,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:35,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:35,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:35,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:35,101 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 6 states. [2018-10-23 09:39:35,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:35,492 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-10-23 09:39:35,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:35,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:35,494 INFO L225 Difference]: With dead ends: 168 [2018-10-23 09:39:35,494 INFO L226 Difference]: Without dead ends: 166 [2018-10-23 09:39:35,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-23 09:39:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 101. [2018-10-23 09:39:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-23 09:39:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-10-23 09:39:35,504 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2018-10-23 09:39:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:35,504 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-10-23 09:39:35,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-10-23 09:39:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 09:39:35,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:35,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:35,506 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:35,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2018-10-23 09:39:35,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:35,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:35,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:35,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:35,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:35,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:35,577 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2018-10-23 09:39:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:35,933 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-10-23 09:39:35,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:35,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-23 09:39:35,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:35,937 INFO L225 Difference]: With dead ends: 128 [2018-10-23 09:39:35,937 INFO L226 Difference]: Without dead ends: 126 [2018-10-23 09:39:35,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-23 09:39:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-10-23 09:39:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-23 09:39:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-10-23 09:39:35,947 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2018-10-23 09:39:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:35,947 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-10-23 09:39:35,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-10-23 09:39:35,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:35,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:35,949 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:35,950 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:35,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2018-10-23 09:39:35,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:35,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:35,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:36,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:36,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:36,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:36,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:36,204 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 8 states. [2018-10-23 09:39:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:36,706 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-10-23 09:39:36,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:36,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-23 09:39:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:36,708 INFO L225 Difference]: With dead ends: 116 [2018-10-23 09:39:36,708 INFO L226 Difference]: Without dead ends: 114 [2018-10-23 09:39:36,709 INFO L605 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 [2018-10-23 09:39:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-23 09:39:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-10-23 09:39:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-23 09:39:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2018-10-23 09:39:36,718 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 14 [2018-10-23 09:39:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:36,719 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2018-10-23 09:39:36,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2018-10-23 09:39:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:36,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:36,720 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:36,720 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:36,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2018-10-23 09:39:36,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:36,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:36,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:36,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:36,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:36,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:36,796 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 6 states. [2018-10-23 09:39:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:37,785 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-10-23 09:39:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:37,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-10-23 09:39:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:37,787 INFO L225 Difference]: With dead ends: 158 [2018-10-23 09:39:37,787 INFO L226 Difference]: Without dead ends: 156 [2018-10-23 09:39:37,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-10-23 09:39:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-23 09:39:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2018-10-23 09:39:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-23 09:39:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-10-23 09:39:37,794 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 14 [2018-10-23 09:39:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:37,794 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-10-23 09:39:37,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-10-23 09:39:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 09:39:37,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:37,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:37,796 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:37,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2018-10-23 09:39:37,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:37,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:37,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:37,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:38,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:38,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:38,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:38,049 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 8 states. [2018-10-23 09:39:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:38,538 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-10-23 09:39:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:38,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-23 09:39:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:38,541 INFO L225 Difference]: With dead ends: 95 [2018-10-23 09:39:38,541 INFO L226 Difference]: Without dead ends: 91 [2018-10-23 09:39:38,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-23 09:39:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-23 09:39:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-23 09:39:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-23 09:39:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-10-23 09:39:38,547 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 14 [2018-10-23 09:39:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:38,547 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-10-23 09:39:38,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-10-23 09:39:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 09:39:38,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:38,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:38,549 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:38,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2018-10-23 09:39:38,549 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:38,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:38,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:38,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:38,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:38,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:38,823 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 8 states. [2018-10-23 09:39:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:39,430 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2018-10-23 09:39:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:39,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-10-23 09:39:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:39,432 INFO L225 Difference]: With dead ends: 107 [2018-10-23 09:39:39,432 INFO L226 Difference]: Without dead ends: 105 [2018-10-23 09:39:39,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-23 09:39:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-23 09:39:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-10-23 09:39:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-23 09:39:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2018-10-23 09:39:39,438 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 15 [2018-10-23 09:39:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:39,438 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2018-10-23 09:39:39,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2018-10-23 09:39:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 09:39:39,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:39,440 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:39,440 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:39,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2018-10-23 09:39:39,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:39,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:39,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:39,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:39,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:39,633 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 7 states. [2018-10-23 09:39:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:39,960 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-10-23 09:39:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:39,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-10-23 09:39:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:39,962 INFO L225 Difference]: With dead ends: 104 [2018-10-23 09:39:39,963 INFO L226 Difference]: Without dead ends: 102 [2018-10-23 09:39:39,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-23 09:39:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2018-10-23 09:39:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-23 09:39:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-10-23 09:39:39,968 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 16 [2018-10-23 09:39:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:39,969 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-10-23 09:39:39,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-10-23 09:39:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 09:39:39,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:39,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:39,971 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:39,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2018-10-23 09:39:39,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:39,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:39,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:39,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:40,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:40,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 09:39:40,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 09:39:40,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 09:39:40,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 09:39:40,097 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 6 states. [2018-10-23 09:39:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:40,683 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-10-23 09:39:40,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:40,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-23 09:39:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:40,685 INFO L225 Difference]: With dead ends: 100 [2018-10-23 09:39:40,686 INFO L226 Difference]: Without dead ends: 54 [2018-10-23 09:39:40,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-23 09:39:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-23 09:39:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-23 09:39:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-23 09:39:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-23 09:39:40,688 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 17 [2018-10-23 09:39:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:40,688 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-23 09:39:40,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 09:39:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-23 09:39:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-23 09:39:40,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:40,689 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:40,690 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:40,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2018-10-23 09:39:40,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:40,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:40,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:40,826 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 7 states. [2018-10-23 09:39:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:40,969 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-23 09:39:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:40,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-23 09:39:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:40,971 INFO L225 Difference]: With dead ends: 54 [2018-10-23 09:39:40,971 INFO L226 Difference]: Without dead ends: 52 [2018-10-23 09:39:40,972 INFO L605 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 [2018-10-23 09:39:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-23 09:39:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-23 09:39:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-23 09:39:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-23 09:39:40,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2018-10-23 09:39:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:40,975 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-23 09:39:40,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-23 09:39:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-23 09:39:40,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:40,977 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:40,977 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:40,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2018-10-23 09:39:40,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:40,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:40,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:41,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 09:39:41,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 09:39:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 09:39:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 09:39:41,093 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 7 states. [2018-10-23 09:39:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:41,244 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-23 09:39:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 09:39:41,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-23 09:39:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:41,246 INFO L225 Difference]: With dead ends: 59 [2018-10-23 09:39:41,246 INFO L226 Difference]: Without dead ends: 57 [2018-10-23 09:39:41,247 INFO L605 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 [2018-10-23 09:39:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-23 09:39:41,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-10-23 09:39:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-23 09:39:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-23 09:39:41,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2018-10-23 09:39:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:41,249 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-23 09:39:41,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 09:39:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-23 09:39:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-23 09:39:41,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:41,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:41,251 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:41,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2018-10-23 09:39:41,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:41,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:41,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:41,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:41,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:41,361 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 8 states. [2018-10-23 09:39:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:41,559 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-23 09:39:41,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 09:39:41,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-10-23 09:39:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:41,561 INFO L225 Difference]: With dead ends: 50 [2018-10-23 09:39:41,561 INFO L226 Difference]: Without dead ends: 46 [2018-10-23 09:39:41,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-23 09:39:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-23 09:39:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-23 09:39:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-23 09:39:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-23 09:39:41,564 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2018-10-23 09:39:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:41,565 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-23 09:39:41,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-23 09:39:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-23 09:39:41,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 09:39:41,566 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 09:39:41,566 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 09:39:41,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 09:39:41,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2018-10-23 09:39:41,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 09:39:41,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 09:39:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:41,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 09:39:41,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 09:39:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 09:39:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 09:39:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 09:39:41,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 09:39:41,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 09:39:41,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 09:39:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-23 09:39:41,740 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 8 states. [2018-10-23 09:39:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 09:39:41,959 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-23 09:39:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 09:39:41,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-10-23 09:39:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 09:39:41,960 INFO L225 Difference]: With dead ends: 50 [2018-10-23 09:39:41,960 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 09:39:41,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-23 09:39:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 09:39:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 09:39:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 09:39:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 09:39:41,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-10-23 09:39:41,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 09:39:41,963 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 09:39:41,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 09:39:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 09:39:41,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 09:39:41,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 09:39:42,582 WARN L179 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 8 [2018-10-23 09:39:42,949 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 6 [2018-10-23 09:39:43,157 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-23 09:39:43,244 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2018-10-23 09:39:43,244 INFO L428 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-23 09:39:43,245 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2018-10-23 09:39:43,246 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L421 ceAbstractionStarter]: At program point L863(lines 21 995) 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)) [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2018-10-23 09:39:43,247 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2018-10-23 09:39:43,248 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L421 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2018-10-23 09:39:43,249 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L428 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2018-10-23 09:39:43,250 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2018-10-23 09:39:43,251 INFO L421 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 1)) [2018-10-23 09:39:43,251 INFO L425 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2018-10-23 09:39:43,252 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2018-10-23 09:39:43,253 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L421 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)) (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2018-10-23 09:39:43,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-23 09:39:43,255 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2018-10-23 09:39:43,256 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2018-10-23 09:39:43,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2018-10-23 09:39:43,258 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2018-10-23 09:39:43,259 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2018-10-23 09:39:43,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:39:43 BoogieIcfgContainer [2018-10-23 09:39:43,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 09:39:43,277 INFO L168 Benchmark]: Toolchain (without parser) took 13754.94 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 874.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -697.2 MB). Peak memory consumption was 177.3 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:43,279 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:43,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:43,280 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 09:39:43,280 INFO L168 Benchmark]: Boogie Preprocessor took 134.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:43,281 INFO L168 Benchmark]: RCFGBuilder took 1154.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:43,282 INFO L168 Benchmark]: TraceAbstraction took 11859.33 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB. [2018-10-23 09:39:43,287 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 535.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1154.53 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11859.33 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 165.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 168]: 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: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: 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: 100]: 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: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: 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: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (!(main__t == main__tagbuf_len) && main__t <= main__tagbuf_len) && 1 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 1 <= main__t) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. SAFE Result, 11.7s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 461 SDtfs, 3068 SDslu, 855 SDs, 0 SdLazy, 3813 SolverSat, 714 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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, 16 MinimizatonAttempts, 274 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 14 NumberOfFragments, 37 HoareAnnotationTreeSize, 6 FomulaSimplifications, 60722 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 175 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 17190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...