java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:45:30,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:45:30,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:45:31,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:45:31,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:45:31,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:45:31,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:45:31,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:45:31,009 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:45:31,010 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:45:31,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:45:31,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:45:31,013 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:45:31,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:45:31,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:45:31,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:45:31,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:45:31,021 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:45:31,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:45:31,035 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:45:31,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:45:31,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:45:31,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:45:31,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:45:31,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:45:31,042 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:45:31,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:45:31,044 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:45:31,044 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:45:31,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:45:31,047 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:45:31,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:45:31,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:45:31,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:45:31,049 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:45:31,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:45:31,050 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:45:31,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:45:31,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:45:31,067 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:45:31,067 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:45:31,067 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:45:31,067 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:45:31,067 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:45:31,068 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:45:31,068 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:45:31,068 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:45:31,068 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:45:31,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:45:31,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:45:31,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:45:31,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:45:31,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:45:31,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:45:31,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:45:31,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:45:31,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:45:31,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:45:31,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:45:31,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:45:31,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:45:31,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:45:31,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:45:31,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:45:31,073 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:45:31,073 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:45:31,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:45:31,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:45:31,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:45:31,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:45:31,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:45:31,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-07 16:45:31,199 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110af6406/4a5f740d30004cdea6be9a6c6056683c/FLAGba061b02d [2018-11-07 16:45:31,682 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:45:31,682 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-07 16:45:31,694 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110af6406/4a5f740d30004cdea6be9a6c6056683c/FLAGba061b02d [2018-11-07 16:45:31,711 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/110af6406/4a5f740d30004cdea6be9a6c6056683c [2018-11-07 16:45:31,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:45:31,723 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:45:31,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:45:31,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:45:31,729 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:45:31,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:45:31" (1/1) ... [2018-11-07 16:45:31,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37fc086b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:31, skipping insertion in model container [2018-11-07 16:45:31,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:45:31" (1/1) ... [2018-11-07 16:45:31,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:45:31,793 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:45:32,055 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:45:32,059 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:45:32,109 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:45:32,136 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:45:32,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32 WrapperNode [2018-11-07 16:45:32,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:45:32,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:45:32,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:45:32,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:45:32,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:45:32,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:45:32,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:45:32,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:45:32,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... [2018-11-07 16:45:32,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:45:32,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:45:32,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:45:32,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:45:32,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:45:32,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:45:32,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:45:32,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:45:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:45:32,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:45:32,330 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:45:32,976 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:45:32,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:45:32 BoogieIcfgContainer [2018-11-07 16:45:32,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:45:32,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:45:32,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:45:32,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:45:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:45:31" (1/3) ... [2018-11-07 16:45:32,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390bba4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:45:32, skipping insertion in model container [2018-11-07 16:45:32,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:45:32" (2/3) ... [2018-11-07 16:45:32,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390bba4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:45:32, skipping insertion in model container [2018-11-07 16:45:32,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:45:32" (3/3) ... [2018-11-07 16:45:32,984 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-07 16:45:32,994 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:45:33,004 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-07 16:45:33,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-07 16:45:33,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:45:33,063 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:45:33,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:45:33,064 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:45:33,064 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:45:33,064 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:45:33,064 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:45:33,064 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:45:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-07 16:45:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 16:45:33,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:33,098 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:33,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:33,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-07 16:45:33,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:33,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:33,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:33,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:33,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:33,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:33,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:45:33,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:33,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:45:33,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:45:33,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:45:33,405 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-07 16:45:33,742 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-07 16:45:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:34,232 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-07 16:45:34,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:45:34,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-07 16:45:34,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:34,249 INFO L225 Difference]: With dead ends: 129 [2018-11-07 16:45:34,250 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 16:45:34,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:45:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 16:45:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-07 16:45:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-07 16:45:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-07 16:45:34,296 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-07 16:45:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:34,297 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-07 16:45:34,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:45:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-07 16:45:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-07 16:45:34,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:34,298 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:34,299 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:34,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-07 16:45:34,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 16:45:34,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:34,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:45:34,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:45:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-07 16:45:34,369 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-07 16:45:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:34,521 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-07 16:45:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:45:34,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-07 16:45:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:34,524 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:45:34,524 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:45:34,525 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:45:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:45:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-07 16:45:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-07 16:45:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-07 16:45:34,534 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-07 16:45:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-07 16:45:34,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:45:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-07 16:45:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:45:34,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:34,536 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:34,536 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:34,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-07 16:45:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:34,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:34,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:34,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 16:45:34,629 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:34,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:45:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:45:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 16:45:34,630 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-07 16:45:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:35,097 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-07 16:45:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:45:35,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-07 16:45:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:35,102 INFO L225 Difference]: With dead ends: 73 [2018-11-07 16:45:35,103 INFO L226 Difference]: Without dead ends: 71 [2018-11-07 16:45:35,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:45:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-07 16:45:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-07 16:45:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-07 16:45:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-07 16:45:35,120 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-07 16:45:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:35,121 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-07 16:45:35,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:45:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-07 16:45:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:45:35,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:35,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:35,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:35,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-07 16:45:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:35,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:35,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:35,275 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:35,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:35,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:35,277 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-07 16:45:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:35,543 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-07 16:45:35,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:35,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 16:45:35,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:35,546 INFO L225 Difference]: With dead ends: 107 [2018-11-07 16:45:35,546 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 16:45:35,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:35,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 16:45:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-07 16:45:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 16:45:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-07 16:45:35,556 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-07 16:45:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-07 16:45:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-07 16:45:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:45:35,557 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:35,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:35,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:35,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-07 16:45:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:35,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-11-07 16:45:35,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:35,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:35,632 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:35,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:35,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:35,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:35,634 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-07 16:45:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:35,855 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-07 16:45:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:35,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-07 16:45:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:35,865 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:45:35,865 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:45:35,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:45:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-07 16:45:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 16:45:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-07 16:45:35,873 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-07 16:45:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:35,874 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-07 16:45:35,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-07 16:45:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:45:35,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:35,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:35,876 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:35,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-07 16:45:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:35,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:36,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:36,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:36,058 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-07 16:45:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:36,497 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-07 16:45:36,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:36,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:45:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:36,500 INFO L225 Difference]: With dead ends: 146 [2018-11-07 16:45:36,500 INFO L226 Difference]: Without dead ends: 144 [2018-11-07 16:45:36,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-07 16:45:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-07 16:45:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 16:45:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-07 16:45:36,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-07 16:45:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:36,513 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-07 16:45:36,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-07 16:45:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:45:36,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:36,520 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:36,520 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-07 16:45:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:36,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:36,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:36,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:36,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:36,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:36,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:36,621 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-07 16:45:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:36,823 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-07 16:45:36,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:36,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:45:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:36,826 INFO L225 Difference]: With dead ends: 99 [2018-11-07 16:45:36,826 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 16:45:36,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:45:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 16:45:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-07 16:45:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:45:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 16:45:36,836 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-07 16:45:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:36,836 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 16:45:36,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 16:45:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:45:36,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:36,837 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:36,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:36,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-07 16:45:36,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:36,840 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:36,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:36,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:36,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:36,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:36,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:36,913 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-07 16:45:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:37,114 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-07 16:45:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:37,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:45:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:37,115 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:45:37,115 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 16:45:37,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:45:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 16:45:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-07 16:45:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:45:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 16:45:37,122 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-07 16:45:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:37,123 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 16:45:37,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 16:45:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:45:37,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:37,124 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:37,125 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:37,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-07 16:45:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,127 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 16:45:37,368 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:37,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:45:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:45:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:45:37,369 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-07 16:45:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:37,632 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-07 16:45:37,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:37,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-07 16:45:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:37,634 INFO L225 Difference]: With dead ends: 95 [2018-11-07 16:45:37,634 INFO L226 Difference]: Without dead ends: 93 [2018-11-07 16:45:37,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:45:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-07 16:45:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-07 16:45:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:45:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 16:45:37,641 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-07 16:45:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:37,642 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 16:45:37,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:45:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 16:45:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:45:37,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:37,643 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:37,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:37,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-07 16:45:37,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:37,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:37,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:37,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:37,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:37,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:37,706 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-07 16:45:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:37,858 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-07 16:45:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:37,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 16:45:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:37,861 INFO L225 Difference]: With dead ends: 72 [2018-11-07 16:45:37,861 INFO L226 Difference]: Without dead ends: 70 [2018-11-07 16:45:37,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-07 16:45:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-07 16:45:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:45:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 16:45:37,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-07 16:45:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:37,869 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 16:45:37,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:37,869 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 16:45:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:45:37,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:37,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:37,871 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:37,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-07 16:45:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:37,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:37,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:37,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:37,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:37,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:37,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:37,942 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-07 16:45:38,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:38,040 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-07 16:45:38,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:38,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 16:45:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:38,042 INFO L225 Difference]: With dead ends: 53 [2018-11-07 16:45:38,042 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 16:45:38,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 16:45:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-07 16:45:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:45:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 16:45:38,050 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-07 16:45:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:38,050 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 16:45:38,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 16:45:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:45:38,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:38,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:38,052 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:38,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-07 16:45:38,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:38,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:38,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-07 16:45:38,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:38,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:45:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:45:38,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:45:38,184 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-07 16:45:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:38,459 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-07 16:45:38,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:38,461 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-07 16:45:38,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:38,463 INFO L225 Difference]: With dead ends: 51 [2018-11-07 16:45:38,463 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 16:45:38,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:45:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 16:45:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-07 16:45:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-07 16:45:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-07 16:45:38,469 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-07 16:45:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-07 16:45:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:45:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-07 16:45:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:45:38,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:38,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:38,471 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:38,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-07 16:45:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:38,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:38,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:38,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:38,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:38,532 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-07 16:45:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:38,891 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-07 16:45:38,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:38,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-07 16:45:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:38,892 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:45:38,893 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 16:45:38,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 16:45:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-07 16:45:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-07 16:45:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-07 16:45:38,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-07 16:45:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:38,898 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-07 16:45:38,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-07 16:45:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:45:38,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:38,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:38,900 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:38,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-07 16:45:38,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:38,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:38,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:38,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:39,186 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-07 16:45:39,375 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-11-07 16:45:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:39,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:39,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 16:45:39,406 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:39,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:45:39,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:45:39,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:39,407 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-07 16:45:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:39,614 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-07 16:45:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:39,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 16:45:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:39,616 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:45:39,616 INFO L226 Difference]: Without dead ends: 55 [2018-11-07 16:45:39,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:45:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-07 16:45:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-07 16:45:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 16:45:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-07 16:45:39,623 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-07 16:45:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:39,623 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-07 16:45:39,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:45:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-07 16:45:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 16:45:39,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:39,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:39,625 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:39,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:39,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-07 16:45:39,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:39,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:39,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 16:45:39,734 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:39,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:45:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:45:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:39,735 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-07 16:45:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:39,889 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-07 16:45:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:45:39,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-07 16:45:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:39,891 INFO L225 Difference]: With dead ends: 41 [2018-11-07 16:45:39,891 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:45:39,892 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:45:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:45:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-07 16:45:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-07 16:45:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-07 16:45:39,899 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-07 16:45:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:39,900 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-07 16:45:39,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:45:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-07 16:45:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:45:39,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:39,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:45:39,902 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:39,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-07 16:45:39,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:39,904 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:40,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:40,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-07 16:45:40,101 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:40,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:45:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:45:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:45:40,103 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-07 16:45:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:40,668 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-07 16:45:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:40,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-07 16:45:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:40,670 INFO L225 Difference]: With dead ends: 52 [2018-11-07 16:45:40,670 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:45:40,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:45:40,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:45:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-07 16:45:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 16:45:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-07 16:45:40,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-07 16:45:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:40,675 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-07 16:45:40,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:45:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-07 16:45:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-07 16:45:40,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:40,676 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] [2018-11-07 16:45:40,677 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:40,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-07 16:45:40,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:40,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 16:45:40,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:40,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:45:40,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:45:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-07 16:45:40,892 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-07 16:45:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:41,152 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-07 16:45:41,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:41,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-07 16:45:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:41,154 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:45:41,154 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 16:45:41,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:45:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 16:45:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-07 16:45:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 16:45:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-07 16:45:41,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-07 16:45:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:41,160 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-07 16:45:41,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:45:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-07 16:45:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:45:41,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:45:41,161 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] [2018-11-07 16:45:41,161 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:45:41,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:45:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-07 16:45:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:45:41,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:41,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:45:41,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:45:41,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:45:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:45:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:45:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:45:41,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:45:41,261 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:45:41,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:45:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:45:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:45:41,262 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-07 16:45:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:45:41,369 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-07 16:45:41,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:45:41,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 16:45:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:45:41,370 INFO L225 Difference]: With dead ends: 37 [2018-11-07 16:45:41,370 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:45:41,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:45:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:45:41,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:45:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:45:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:45:41,373 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-07 16:45:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:45:41,373 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:45:41,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:45:41,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:45:41,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:45:41,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:45:41,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:45:41,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:45:41,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:45:41,901 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-07 16:45:42,318 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-07 16:45:43,039 WARN L179 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2018-11-07 16:45:43,112 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:45:43,112 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:45:43,113 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:45:43,113 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-07 16:45:43,113 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-07 16:45:43,114 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-07 16:45:43,115 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-07 16:45:43,116 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-07 16:45:43,116 INFO L421 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-07 16:45:43,116 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-07 16:45:43,116 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-07 16:45:43,116 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-07 16:45:43,116 INFO L421 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= 1 main_~__VERIFIER_assert__cond~0) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-07 16:45:43,116 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-07 16:45:43,116 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-07 16:45:43,117 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-07 16:45:43,118 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-07 16:45:43,119 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L421 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-07 16:45:43,120 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-07 16:45:43,120 INFO L421 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-07 16:45:43,121 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-07 16:45:43,122 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-07 16:45:43,122 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-07 16:45:43,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:45:43 BoogieIcfgContainer [2018-11-07 16:45:43,143 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:45:43,144 INFO L168 Benchmark]: Toolchain (without parser) took 11421.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -196.8 MB). Peak memory consumption was 550.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:45:43,146 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:45:43,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.13 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:45:43,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.42 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-11-07 16:45:43,148 INFO L168 Benchmark]: Boogie Preprocessor took 35.19 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-11-07 16:45:43,149 INFO L168 Benchmark]: RCFGBuilder took 776.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:45:43,149 INFO L168 Benchmark]: TraceAbstraction took 10165.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 571.3 MB). Peak memory consumption was 571.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:45:43,155 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 413.13 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.42 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 35.19 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. * RCFGBuilder took 776.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10165.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 571.3 MB). Peak memory consumption was 571.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 10.0s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 1999 SDslu, 1410 SDs, 0 SdLazy, 1547 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 64 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...