java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 10:05:00,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 10:05:00,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 10:05:00,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 10:05:00,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 10:05:00,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 10:05:00,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 10:05:00,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 10:05:00,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 10:05:00,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 10:05:00,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 10:05:00,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 10:05:00,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 10:05:00,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 10:05:00,146 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 10:05:00,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 10:05:00,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 10:05:00,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 10:05:00,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 10:05:00,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 10:05:00,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 10:05:00,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 10:05:00,157 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 10:05:00,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 10:05:00,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 10:05:00,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 10:05:00,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 10:05:00,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 10:05:00,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 10:05:00,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 10:05:00,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 10:05:00,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 10:05:00,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 10:05:00,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 10:05:00,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 10:05:00,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 10:05:00,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 10:05:00,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 10:05:00,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 10:05:00,202 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 10:05:00,203 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 10:05:00,203 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 10:05:00,203 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 10:05:00,203 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 10:05:00,204 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 10:05:00,204 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 10:05:00,204 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 10:05:00,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 10:05:00,204 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 10:05:00,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 10:05:00,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 10:05:00,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 10:05:00,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 10:05:00,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 10:05:00,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 10:05:00,209 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 10:05:00,209 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 10:05:00,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 10:05:00,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 10:05:00,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 10:05:00,210 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 10:05:00,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 10:05:00,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 10:05:00,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 10:05:00,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 10:05:00,211 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 10:05:00,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 10:05:00,211 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 10:05:00,211 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 10:05:00,212 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 10:05:00,212 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 10:05:00,256 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 10:05:00,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 10:05:00,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 10:05:00,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 10:05:00,280 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 10:05:00,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 10:05:00,345 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdc15b435/b9195e675d7a4b0a8e31739515a59786/FLAG9a2730c59 [2018-10-23 10:05:00,800 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 10:05:00,801 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 10:05:00,812 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdc15b435/b9195e675d7a4b0a8e31739515a59786/FLAG9a2730c59 [2018-10-23 10:05:00,827 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cdc15b435/b9195e675d7a4b0a8e31739515a59786 [2018-10-23 10:05:00,841 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 10:05:00,842 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 10:05:00,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 10:05:00,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 10:05:00,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 10:05:00,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:05:00" (1/1) ... [2018-10-23 10:05:00,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6465e754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:00, skipping insertion in model container [2018-10-23 10:05:00,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:05:00" (1/1) ... [2018-10-23 10:05:00,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 10:05:00,907 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 10:05:01,151 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:05:01,157 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 10:05:01,196 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:05:01,212 INFO L193 MainTranslator]: Completed translation [2018-10-23 10:05:01,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01 WrapperNode [2018-10-23 10:05:01,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 10:05:01,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 10:05:01,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 10:05:01,214 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 10:05:01,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 10:05:01,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 10:05:01,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 10:05:01,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 10:05:01,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... [2018-10-23 10:05:01,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 10:05:01,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 10:05:01,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 10:05:01,270 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 10:05:01,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 10:05:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 10:05:01,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 10:05:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 10:05:01,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 10:05:01,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 10:05:01,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 10:05:02,037 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 10:05:02,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:05:02 BoogieIcfgContainer [2018-10-23 10:05:02,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 10:05:02,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 10:05:02,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 10:05:02,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 10:05:02,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:05:00" (1/3) ... [2018-10-23 10:05:02,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1065c33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:05:02, skipping insertion in model container [2018-10-23 10:05:02,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:01" (2/3) ... [2018-10-23 10:05:02,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1065c33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:05:02, skipping insertion in model container [2018-10-23 10:05:02,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:05:02" (3/3) ... [2018-10-23 10:05:02,047 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-10-23 10:05:02,057 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 10:05:02,067 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-23 10:05:02,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-23 10:05:02,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 10:05:02,132 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 10:05:02,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 10:05:02,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 10:05:02,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 10:05:02,133 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 10:05:02,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 10:05:02,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 10:05:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-23 10:05:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 10:05:02,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:02,160 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:02,163 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:02,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-10-23 10:05:02,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:02,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:02,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:02,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:02,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 10:05:02,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:02,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 10:05:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 10:05:02,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 10:05:02,518 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-10-23 10:05:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:03,103 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-10-23 10:05:03,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 10:05:03,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-23 10:05:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:03,120 INFO L225 Difference]: With dead ends: 129 [2018-10-23 10:05:03,120 INFO L226 Difference]: Without dead ends: 113 [2018-10-23 10:05:03,128 INFO L605 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-10-23 10:05:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-23 10:05:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-10-23 10:05:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-23 10:05:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-10-23 10:05:03,173 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-10-23 10:05:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:03,174 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-10-23 10:05:03,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 10:05:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-10-23 10:05:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-23 10:05:03,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:03,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:03,176 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:03,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-10-23 10:05:03,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:03,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:03,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:03,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:03,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 10:05:03,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:03,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 10:05:03,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 10:05:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-23 10:05:03,259 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-10-23 10:05:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:03,418 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-23 10:05:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 10:05:03,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-23 10:05:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:03,421 INFO L225 Difference]: With dead ends: 69 [2018-10-23 10:05:03,421 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 10:05:03,422 INFO L605 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-10-23 10:05:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 10:05:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-23 10:05:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-23 10:05:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-23 10:05:03,431 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-10-23 10:05:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:03,432 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-23 10:05:03,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 10:05:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-23 10:05:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 10:05:03,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:03,433 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:03,434 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:03,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:03,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-10-23 10:05:03,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:03,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:03,436 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-23 10:05:03,516 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:03,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 10:05:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 10:05:03,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-23 10:05:03,518 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-10-23 10:05:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:04,006 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-10-23 10:05:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 10:05:04,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-23 10:05:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:04,009 INFO L225 Difference]: With dead ends: 73 [2018-10-23 10:05:04,009 INFO L226 Difference]: Without dead ends: 71 [2018-10-23 10:05:04,010 INFO L605 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-10-23 10:05:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-23 10:05:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-23 10:05:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-23 10:05:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-10-23 10:05:04,020 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-10-23 10:05:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:04,021 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-10-23 10:05:04,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 10:05:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-10-23 10:05:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 10:05:04,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:04,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:04,023 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:04,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-10-23 10:05:04,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:04,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:04,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:04,161 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:04,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:04,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:04,162 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-10-23 10:05:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:04,443 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-10-23 10:05:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:04,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-10-23 10:05:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:04,446 INFO L225 Difference]: With dead ends: 107 [2018-10-23 10:05:04,446 INFO L226 Difference]: Without dead ends: 105 [2018-10-23 10:05:04,447 INFO L605 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-10-23 10:05:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-23 10:05:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-10-23 10:05:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-23 10:05:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-10-23 10:05:04,455 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-10-23 10:05:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:04,456 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-10-23 10:05:04,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-10-23 10:05:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 10:05:04,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:04,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:04,458 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:04,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-10-23 10:05:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:04,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:04,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:04,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:04,548 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:04,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:04,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:04,549 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-10-23 10:05:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:04,722 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-10-23 10:05:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:04,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-10-23 10:05:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:04,725 INFO L225 Difference]: With dead ends: 69 [2018-10-23 10:05:04,725 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 10:05:04,726 INFO L605 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-10-23 10:05:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 10:05:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-23 10:05:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-23 10:05:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-10-23 10:05:04,744 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-10-23 10:05:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:04,745 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-10-23 10:05:04,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-10-23 10:05:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 10:05:04,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:04,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:04,750 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:04,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-10-23 10:05:04,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:04,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:04,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:04,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:04,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:04,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:04,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:04,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:04,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:04,924 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-10-23 10:05:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:05,188 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-10-23 10:05:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:05,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-23 10:05:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:05,191 INFO L225 Difference]: With dead ends: 146 [2018-10-23 10:05:05,191 INFO L226 Difference]: Without dead ends: 144 [2018-10-23 10:05:05,191 INFO L605 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-10-23 10:05:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-23 10:05:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-10-23 10:05:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-23 10:05:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-10-23 10:05:05,200 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-10-23 10:05:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:05,201 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-10-23 10:05:05,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-10-23 10:05:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 10:05:05,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:05,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:05,203 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:05,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-10-23 10:05:05,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:05,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:05,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:05,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:05,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:05,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:05,296 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-10-23 10:05:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:05,499 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-10-23 10:05:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:05,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-23 10:05:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:05,503 INFO L225 Difference]: With dead ends: 99 [2018-10-23 10:05:05,503 INFO L226 Difference]: Without dead ends: 95 [2018-10-23 10:05:05,504 INFO L605 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-10-23 10:05:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-23 10:05:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-10-23 10:05:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-23 10:05:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-10-23 10:05:05,511 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-10-23 10:05:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:05,512 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-10-23 10:05:05,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-10-23 10:05:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-23 10:05:05,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:05,513 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:05,514 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:05,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:05,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-10-23 10:05:05,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:05,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:05,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:05,616 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-10-23 10:05:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:05,790 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-23 10:05:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:05,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-23 10:05:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:05,792 INFO L225 Difference]: With dead ends: 61 [2018-10-23 10:05:05,792 INFO L226 Difference]: Without dead ends: 57 [2018-10-23 10:05:05,793 INFO L605 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-10-23 10:05:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-23 10:05:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-23 10:05:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-23 10:05:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-23 10:05:05,803 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-10-23 10:05:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:05,804 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-23 10:05:05,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-23 10:05:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 10:05:05,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:05,805 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:05,808 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:05,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:05,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-10-23 10:05:05,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:05,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:05,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:06,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:06,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 10:05:06,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:06,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 10:05:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 10:05:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 10:05:06,074 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-10-23 10:05:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:06,329 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-10-23 10:05:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:06,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-10-23 10:05:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:06,331 INFO L225 Difference]: With dead ends: 95 [2018-10-23 10:05:06,332 INFO L226 Difference]: Without dead ends: 93 [2018-10-23 10:05:06,333 INFO L605 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-10-23 10:05:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-23 10:05:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-10-23 10:05:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-23 10:05:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-10-23 10:05:06,338 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-10-23 10:05:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:06,339 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-10-23 10:05:06,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 10:05:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-10-23 10:05:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 10:05:06,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:06,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:06,341 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:06,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-10-23 10:05:06,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:06,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:06,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:06,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:06,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:06,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:06,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:06,405 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-10-23 10:05:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:06,585 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-10-23 10:05:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:06,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-23 10:05:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:06,587 INFO L225 Difference]: With dead ends: 72 [2018-10-23 10:05:06,588 INFO L226 Difference]: Without dead ends: 70 [2018-10-23 10:05:06,589 INFO L605 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-10-23 10:05:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-23 10:05:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-10-23 10:05:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-23 10:05:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-23 10:05:06,595 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-10-23 10:05:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:06,596 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-23 10:05:06,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-23 10:05:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-23 10:05:06,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:06,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:06,598 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:06,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:06,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-10-23 10:05:06,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:06,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:06,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:06,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:06,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:06,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:06,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:06,664 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-10-23 10:05:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:06,781 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-10-23 10:05:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:06,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-23 10:05:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:06,785 INFO L225 Difference]: With dead ends: 53 [2018-10-23 10:05:06,785 INFO L226 Difference]: Without dead ends: 51 [2018-10-23 10:05:06,786 INFO L605 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-10-23 10:05:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-23 10:05:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-23 10:05:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-23 10:05:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-23 10:05:06,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-10-23 10:05:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:06,792 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-23 10:05:06,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-23 10:05:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 10:05:06,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:06,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:06,794 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:06,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:06,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-10-23 10:05:06,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:06,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:06,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:06,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:06,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:06,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 10:05:06,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:06,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 10:05:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 10:05:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-23 10:05:06,921 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-10-23 10:05:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:07,186 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-10-23 10:05:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:07,188 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-10-23 10:05:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:07,189 INFO L225 Difference]: With dead ends: 51 [2018-10-23 10:05:07,189 INFO L226 Difference]: Without dead ends: 49 [2018-10-23 10:05:07,190 INFO L605 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-10-23 10:05:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-23 10:05:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-10-23 10:05:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-23 10:05:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-10-23 10:05:07,194 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-10-23 10:05:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:07,194 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-10-23 10:05:07,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 10:05:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-10-23 10:05:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 10:05:07,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:07,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:07,196 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:07,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-10-23 10:05:07,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:07,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:07,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:07,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:07,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:07,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:07,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:07,263 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-10-23 10:05:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:07,631 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-10-23 10:05:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:07,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-23 10:05:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:07,632 INFO L225 Difference]: With dead ends: 69 [2018-10-23 10:05:07,632 INFO L226 Difference]: Without dead ends: 67 [2018-10-23 10:05:07,633 INFO L605 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-10-23 10:05:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-23 10:05:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-10-23 10:05:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-23 10:05:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-10-23 10:05:07,638 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-10-23 10:05:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:07,639 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-10-23 10:05:07,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-10-23 10:05:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 10:05:07,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:07,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:07,641 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:07,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-10-23 10:05:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:07,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:07,966 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-23 10:05:08,141 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-23 10:05:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:08,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 10:05:08,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:08,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 10:05:08,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 10:05:08,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 10:05:08,171 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-10-23 10:05:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:08,383 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-10-23 10:05:08,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:08,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-10-23 10:05:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:08,384 INFO L225 Difference]: With dead ends: 57 [2018-10-23 10:05:08,384 INFO L226 Difference]: Without dead ends: 55 [2018-10-23 10:05:08,385 INFO L605 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-10-23 10:05:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-23 10:05:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-10-23 10:05:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-23 10:05:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-10-23 10:05:08,391 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-10-23 10:05:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:08,391 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-10-23 10:05:08,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 10:05:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-10-23 10:05:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 10:05:08,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:08,393 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:08,393 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:08,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-10-23 10:05:08,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:08,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:08,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:08,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 10:05:08,494 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:08,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 10:05:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 10:05:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 10:05:08,496 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-10-23 10:05:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:08,638 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-10-23 10:05:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-23 10:05:08,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-10-23 10:05:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:08,640 INFO L225 Difference]: With dead ends: 41 [2018-10-23 10:05:08,640 INFO L226 Difference]: Without dead ends: 37 [2018-10-23 10:05:08,641 INFO L605 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-10-23 10:05:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-23 10:05:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-23 10:05:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-23 10:05:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-10-23 10:05:08,647 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-10-23 10:05:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:08,648 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-10-23 10:05:08,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 10:05:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-10-23 10:05:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-23 10:05:08,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:08,649 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-10-23 10:05:08,650 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:08,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-10-23 10:05:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:08,652 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 10:05:08,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:08,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 10:05:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 10:05:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-23 10:05:08,757 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-10-23 10:05:09,108 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-23 10:05:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:09,360 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-10-23 10:05:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:09,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-10-23 10:05:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:09,362 INFO L225 Difference]: With dead ends: 52 [2018-10-23 10:05:09,363 INFO L226 Difference]: Without dead ends: 50 [2018-10-23 10:05:09,363 INFO L605 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-10-23 10:05:09,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-23 10:05:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-10-23 10:05:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-23 10:05:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-23 10:05:09,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-10-23 10:05:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:09,370 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-23 10:05:09,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 10:05:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-23 10:05:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-23 10:05:09,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:09,371 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-10-23 10:05:09,372 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:09,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-10-23 10:05:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:09,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:09,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:09,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 10:05:09,573 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:09,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 10:05:09,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 10:05:09,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-23 10:05:09,574 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-10-23 10:05:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:09,827 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-10-23 10:05:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:09,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-23 10:05:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:09,829 INFO L225 Difference]: With dead ends: 39 [2018-10-23 10:05:09,829 INFO L226 Difference]: Without dead ends: 37 [2018-10-23 10:05:09,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 10:05:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-23 10:05:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-10-23 10:05:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-23 10:05:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-10-23 10:05:09,834 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-10-23 10:05:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:09,834 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-10-23 10:05:09,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 10:05:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-10-23 10:05:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-23 10:05:09,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:09,835 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-10-23 10:05:09,835 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:09,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-10-23 10:05:09,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:09,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:09,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:05:10,047 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:10,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:05:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:05:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:05:10,049 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-10-23 10:05:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:10,152 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-10-23 10:05:10,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:10,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-23 10:05:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:10,153 INFO L225 Difference]: With dead ends: 37 [2018-10-23 10:05:10,153 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 10:05:10,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-10-23 10:05:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 10:05:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 10:05:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 10:05:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 10:05:10,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-10-23 10:05:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:10,155 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 10:05:10,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:05:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 10:05:10,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 10:05:10,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 10:05:10,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 10:05:10,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 10:05:10,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-23 10:05:10,576 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-10-23 10:05:10,923 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2018-10-23 10:05:10,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-23 10:05:10,955 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-23 10:05:10,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:05:10,956 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:05:10,956 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-23 10:05:10,956 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-23 10:05:10,956 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 10:05:10,956 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-10-23 10:05:10,956 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-10-23 10:05:10,956 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-10-23 10:05:10,957 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-10-23 10:05:10,958 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-10-23 10:05:10,959 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-10-23 10:05:10,959 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-10-23 10:05:10,960 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-10-23 10:05:10,960 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-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-10-23 10:05:10,960 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-23 10:05:10,961 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-10-23 10:05:10,962 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-10-23 10:05:10,963 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-10-23 10:05:10,963 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-10-23 10:05:10,963 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-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-10-23 10:05:10,964 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-10-23 10:05:10,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:05:10 BoogieIcfgContainer [2018-10-23 10:05:10,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 10:05:10,981 INFO L168 Benchmark]: Toolchain (without parser) took 10139.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -203.8 MB). Peak memory consumption was 534.4 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:10,982 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:05:10,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.71 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-10-23 10:05:10,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:05:10,984 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:05:10,985 INFO L168 Benchmark]: RCFGBuilder took 769.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:10,986 INFO L168 Benchmark]: TraceAbstraction took 8940.65 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: 559.5 MB). Peak memory consumption was 559.5 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:10,990 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.71 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.70 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 28.37 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 769.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8940.65 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: 559.5 MB). Peak memory consumption was 559.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: 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 - PositiveResult [Line: 184]: 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: 274]: 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: 51]: 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: 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: 172]: 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: 80]: 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: 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 - 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, 8.8s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 1999 SDslu, 1410 SDs, 0 SdLazy, 1547 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.3s 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.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s 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...