java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:02:14,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:02:14,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:02:14,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:02:14,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:02:14,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:02:14,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:02:14,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:02:14,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:02:14,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:02:14,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:02:14,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:02:14,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:02:14,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:02:14,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:02:14,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:02:14,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:02:14,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:02:14,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:02:14,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:02:14,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:02:14,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:02:14,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:02:14,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:02:14,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:02:14,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:02:14,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:02:14,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:02:14,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:02:14,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:02:14,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:02:14,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:02:14,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:02:14,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:02:14,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:02:14,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:02:14,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:02:14,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:02:14,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:02:14,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:02:14,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:02:14,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:02:14,333 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:02:14,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:02:14,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:02:14,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:02:14,337 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:02:14,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:02:14,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:02:14,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:02:14,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:02:14,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:02:14,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:02:14,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:02:14,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:02:14,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:02:14,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:02:14,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:02:14,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:02:14,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:02:14,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:02:14,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:02:14,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:02:14,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:14,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:02:14,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:02:14,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:02:14,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:02:14,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:02:14,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:02:14,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:02:14,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:02:14,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:02:14,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:02:14,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:02:14,640 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:02:14,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-15 03:02:14,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67712df08/58ad7ffba1cf43e88d2b91fc5cc08514/FLAGef8bbafe3 [2019-10-15 03:02:15,254 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:02:15,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-15 03:02:15,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67712df08/58ad7ffba1cf43e88d2b91fc5cc08514/FLAGef8bbafe3 [2019-10-15 03:02:15,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67712df08/58ad7ffba1cf43e88d2b91fc5cc08514 [2019-10-15 03:02:15,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:02:15,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:02:15,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:15,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:02:15,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:02:15,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:15" (1/1) ... [2019-10-15 03:02:15,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783ac0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:15, skipping insertion in model container [2019-10-15 03:02:15,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:02:15" (1/1) ... [2019-10-15 03:02:15,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:02:15,652 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:02:15,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:15,963 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:02:16,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:02:16,150 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:02:16,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16 WrapperNode [2019-10-15 03:02:16,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:02:16,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:02:16,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:02:16,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:02:16,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... [2019-10-15 03:02:16,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:02:16,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:02:16,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:02:16,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:02:16,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:02:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:02:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:02:16,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:02:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:02:16,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:02:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:02:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:02:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:02:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:02:16,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:02:17,123 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:02:17,123 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:02:17,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:17 BoogieIcfgContainer [2019-10-15 03:02:17,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:02:17,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:02:17,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:02:17,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:02:17,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:02:15" (1/3) ... [2019-10-15 03:02:17,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9d1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:17, skipping insertion in model container [2019-10-15 03:02:17,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:02:16" (2/3) ... [2019-10-15 03:02:17,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f9d1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:02:17, skipping insertion in model container [2019-10-15 03:02:17,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:02:17" (3/3) ... [2019-10-15 03:02:17,136 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-10-15 03:02:17,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:02:17,151 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-15 03:02:17,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-15 03:02:17,191 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:02:17,191 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:02:17,192 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:02:17,192 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:02:17,193 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:02:17,194 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:02:17,194 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:02:17,194 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:02:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-10-15 03:02:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:02:17,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:17,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:17,228 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 814642412, now seen corresponding path program 1 times [2019-10-15 03:02:17,243 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:17,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317512617] [2019-10-15 03:02:17,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:17,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317512617] [2019-10-15 03:02:17,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:17,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:17,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681943805] [2019-10-15 03:02:17,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:17,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:17,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:17,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:17,458 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2019-10-15 03:02:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:17,854 INFO L93 Difference]: Finished difference Result 134 states and 210 transitions. [2019-10-15 03:02:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:17,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:02:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:17,869 INFO L225 Difference]: With dead ends: 134 [2019-10-15 03:02:17,869 INFO L226 Difference]: Without dead ends: 117 [2019-10-15 03:02:17,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-15 03:02:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-10-15 03:02:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-15 03:02:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2019-10-15 03:02:17,954 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 10 [2019-10-15 03:02:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:17,955 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2019-10-15 03:02:17,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2019-10-15 03:02:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:02:17,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:17,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:17,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -515885943, now seen corresponding path program 1 times [2019-10-15 03:02:17,963 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:17,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201472694] [2019-10-15 03:02:17,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:17,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:18,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201472694] [2019-10-15 03:02:18,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:18,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:18,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626883131] [2019-10-15 03:02:18,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:18,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:18,071 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand 4 states. [2019-10-15 03:02:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:18,274 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2019-10-15 03:02:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:18,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:02:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:18,277 INFO L225 Difference]: With dead ends: 117 [2019-10-15 03:02:18,278 INFO L226 Difference]: Without dead ends: 112 [2019-10-15 03:02:18,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-15 03:02:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-15 03:02:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-15 03:02:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2019-10-15 03:02:18,290 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 11 [2019-10-15 03:02:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:18,291 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2019-10-15 03:02:18,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2019-10-15 03:02:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:02:18,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:18,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:18,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1762372468, now seen corresponding path program 1 times [2019-10-15 03:02:18,293 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:18,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672248047] [2019-10-15 03:02:18,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:18,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672248047] [2019-10-15 03:02:18,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:18,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:18,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039341965] [2019-10-15 03:02:18,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:18,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:18,353 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 5 states. [2019-10-15 03:02:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:18,573 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-10-15 03:02:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:18,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-15 03:02:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:18,576 INFO L225 Difference]: With dead ends: 112 [2019-10-15 03:02:18,576 INFO L226 Difference]: Without dead ends: 110 [2019-10-15 03:02:18,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-15 03:02:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-10-15 03:02:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-15 03:02:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-10-15 03:02:18,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 14 [2019-10-15 03:02:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:18,586 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-10-15 03:02:18,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-10-15 03:02:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:02:18,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:18,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:18,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1201025248, now seen corresponding path program 1 times [2019-10-15 03:02:18,589 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:18,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473907912] [2019-10-15 03:02:18,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:18,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473907912] [2019-10-15 03:02:18,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:18,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:18,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053410601] [2019-10-15 03:02:18,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:18,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:18,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:18,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:18,669 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 4 states. [2019-10-15 03:02:18,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:18,822 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2019-10-15 03:02:18,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:18,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:02:18,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:18,824 INFO L225 Difference]: With dead ends: 110 [2019-10-15 03:02:18,826 INFO L226 Difference]: Without dead ends: 106 [2019-10-15 03:02:18,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-15 03:02:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-15 03:02:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-15 03:02:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2019-10-15 03:02:18,840 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 15 [2019-10-15 03:02:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:18,841 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2019-10-15 03:02:18,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2019-10-15 03:02:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:02:18,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:18,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:18,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1436191013, now seen corresponding path program 1 times [2019-10-15 03:02:18,845 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:18,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853371512] [2019-10-15 03:02:18,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,846 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:18,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:18,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853371512] [2019-10-15 03:02:18,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:18,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:18,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632103934] [2019-10-15 03:02:18,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:18,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:18,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:18,958 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 5 states. [2019-10-15 03:02:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:19,233 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2019-10-15 03:02:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:19,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-15 03:02:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:19,238 INFO L225 Difference]: With dead ends: 124 [2019-10-15 03:02:19,239 INFO L226 Difference]: Without dead ends: 122 [2019-10-15 03:02:19,239 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-15 03:02:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2019-10-15 03:02:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-15 03:02:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2019-10-15 03:02:19,259 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16 [2019-10-15 03:02:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:19,259 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2019-10-15 03:02:19,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2019-10-15 03:02:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:02:19,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:19,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:19,266 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1437730213, now seen corresponding path program 1 times [2019-10-15 03:02:19,267 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:19,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152578824] [2019-10-15 03:02:19,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:19,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152578824] [2019-10-15 03:02:19,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:19,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:19,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674183611] [2019-10-15 03:02:19,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:19,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:19,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:19,343 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 5 states. [2019-10-15 03:02:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:19,579 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2019-10-15 03:02:19,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:19,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-15 03:02:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:19,581 INFO L225 Difference]: With dead ends: 104 [2019-10-15 03:02:19,582 INFO L226 Difference]: Without dead ends: 102 [2019-10-15 03:02:19,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-15 03:02:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-10-15 03:02:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-15 03:02:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2019-10-15 03:02:19,591 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 16 [2019-10-15 03:02:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:19,591 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2019-10-15 03:02:19,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2019-10-15 03:02:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:02:19,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:19,593 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:19,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:19,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1572251555, now seen corresponding path program 1 times [2019-10-15 03:02:19,595 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:19,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181366798] [2019-10-15 03:02:19,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:19,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181366798] [2019-10-15 03:02:19,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:19,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:19,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100404219] [2019-10-15 03:02:19,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:19,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:19,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:19,708 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand 5 states. [2019-10-15 03:02:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:19,979 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-10-15 03:02:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:19,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 03:02:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:19,981 INFO L225 Difference]: With dead ends: 119 [2019-10-15 03:02:19,981 INFO L226 Difference]: Without dead ends: 117 [2019-10-15 03:02:19,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-15 03:02:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2019-10-15 03:02:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-15 03:02:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2019-10-15 03:02:19,987 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 17 [2019-10-15 03:02:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:19,987 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2019-10-15 03:02:19,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2019-10-15 03:02:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:02:19,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:19,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:19,989 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1573616975, now seen corresponding path program 1 times [2019-10-15 03:02:19,989 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:19,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015471619] [2019-10-15 03:02:19,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:19,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:20,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015471619] [2019-10-15 03:02:20,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:20,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:20,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503224285] [2019-10-15 03:02:20,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:20,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:20,023 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 5 states. [2019-10-15 03:02:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:20,281 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-10-15 03:02:20,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:20,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 03:02:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:20,284 INFO L225 Difference]: With dead ends: 119 [2019-10-15 03:02:20,284 INFO L226 Difference]: Without dead ends: 117 [2019-10-15 03:02:20,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-15 03:02:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2019-10-15 03:02:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-15 03:02:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-10-15 03:02:20,291 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2019-10-15 03:02:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:20,291 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-10-15 03:02:20,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-10-15 03:02:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:02:20,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:20,292 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:20,293 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1619966805, now seen corresponding path program 1 times [2019-10-15 03:02:20,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:20,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538578144] [2019-10-15 03:02:20,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:20,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:20,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:20,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538578144] [2019-10-15 03:02:20,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:20,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:20,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574504854] [2019-10-15 03:02:20,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:20,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:20,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:20,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:20,351 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 5 states. [2019-10-15 03:02:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:20,615 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2019-10-15 03:02:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:20,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-15 03:02:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:20,617 INFO L225 Difference]: With dead ends: 98 [2019-10-15 03:02:20,617 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 03:02:20,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 03:02:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-10-15 03:02:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-15 03:02:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-10-15 03:02:20,622 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 17 [2019-10-15 03:02:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:20,623 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-10-15 03:02:20,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-10-15 03:02:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:02:20,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:20,624 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:20,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1537489112, now seen corresponding path program 1 times [2019-10-15 03:02:20,625 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:20,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163373773] [2019-10-15 03:02:20,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:20,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:20,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:20,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163373773] [2019-10-15 03:02:20,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:20,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:20,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63385460] [2019-10-15 03:02:20,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:20,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:20,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:20,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:20,709 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 5 states. [2019-10-15 03:02:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:21,028 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2019-10-15 03:02:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:21,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 03:02:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:21,031 INFO L225 Difference]: With dead ends: 110 [2019-10-15 03:02:21,031 INFO L226 Difference]: Without dead ends: 108 [2019-10-15 03:02:21,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-15 03:02:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-10-15 03:02:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-15 03:02:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2019-10-15 03:02:21,041 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 18 [2019-10-15 03:02:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:21,041 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2019-10-15 03:02:21,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2019-10-15 03:02:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:02:21,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:21,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:21,047 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash -894647034, now seen corresponding path program 1 times [2019-10-15 03:02:21,048 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:21,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497089048] [2019-10-15 03:02:21,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:21,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497089048] [2019-10-15 03:02:21,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:21,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:02:21,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096332284] [2019-10-15 03:02:21,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:02:21,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:02:21,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:21,136 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 6 states. [2019-10-15 03:02:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:21,457 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-10-15 03:02:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:21,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-15 03:02:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:21,459 INFO L225 Difference]: With dead ends: 102 [2019-10-15 03:02:21,459 INFO L226 Difference]: Without dead ends: 100 [2019-10-15 03:02:21,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-15 03:02:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2019-10-15 03:02:21,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-15 03:02:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-10-15 03:02:21,468 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 19 [2019-10-15 03:02:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:21,469 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-10-15 03:02:21,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:02:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-10-15 03:02:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:02:21,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:21,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:21,476 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:21,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1964251151, now seen corresponding path program 1 times [2019-10-15 03:02:21,477 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:21,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197912618] [2019-10-15 03:02:21,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:21,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197912618] [2019-10-15 03:02:21,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:21,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:02:21,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915705681] [2019-10-15 03:02:21,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:02:21,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:02:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:02:21,560 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 4 states. [2019-10-15 03:02:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:21,667 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-10-15 03:02:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:02:21,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:02:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:21,669 INFO L225 Difference]: With dead ends: 90 [2019-10-15 03:02:21,669 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 03:02:21,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 03:02:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-15 03:02:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-15 03:02:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-15 03:02:21,674 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 20 [2019-10-15 03:02:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:21,675 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-15 03:02:21,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:02:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-15 03:02:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:02:21,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:21,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:21,678 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1215413267, now seen corresponding path program 1 times [2019-10-15 03:02:21,679 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:21,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296879088] [2019-10-15 03:02:21,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:21,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:21,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296879088] [2019-10-15 03:02:21,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:21,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:02:21,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844452802] [2019-10-15 03:02:21,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:02:21,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:02:21,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:02:21,863 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 13 states. [2019-10-15 03:02:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:22,016 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-10-15 03:02:22,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:02:22,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-15 03:02:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:22,018 INFO L225 Difference]: With dead ends: 66 [2019-10-15 03:02:22,018 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 03:02:22,018 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:02:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 03:02:22,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-15 03:02:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-15 03:02:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-10-15 03:02:22,022 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 47 [2019-10-15 03:02:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:22,022 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-10-15 03:02:22,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:02:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-10-15 03:02:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:02:22,023 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,023 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,024 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1215399365, now seen corresponding path program 1 times [2019-10-15 03:02:22,024 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933030650] [2019-10-15 03:02:22,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:22,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933030650] [2019-10-15 03:02:22,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:02:22,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855473386] [2019-10-15 03:02:22,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:02:22,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:02:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:02:22,212 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 13 states. [2019-10-15 03:02:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:22,363 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-10-15 03:02:22,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:02:22,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-10-15 03:02:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:22,365 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:02:22,365 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:02:22,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:02:22,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:02:22,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-15 03:02:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-15 03:02:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-10-15 03:02:22,369 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2019-10-15 03:02:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:22,370 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-10-15 03:02:22,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:02:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-10-15 03:02:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:02:22,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,371 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash -976890969, now seen corresponding path program 1 times [2019-10-15 03:02:22,372 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189237651] [2019-10-15 03:02:22,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:22,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189237651] [2019-10-15 03:02:22,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:22,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50027517] [2019-10-15 03:02:22,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:22,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:22,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:22,578 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states. [2019-10-15 03:02:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:22,706 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-10-15 03:02:22,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:02:22,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 03:02:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:22,711 INFO L225 Difference]: With dead ends: 61 [2019-10-15 03:02:22,712 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:02:22,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:02:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:02:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2019-10-15 03:02:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-15 03:02:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-10-15 03:02:22,716 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-10-15 03:02:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:22,716 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-10-15 03:02:22,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-10-15 03:02:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:02:22,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:02:22,717 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:02:22,718 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:02:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:02:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash -977321945, now seen corresponding path program 1 times [2019-10-15 03:02:22,719 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:02:22,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445205906] [2019-10-15 03:02:22,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:02:22,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:02:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:02:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:02:22,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445205906] [2019-10-15 03:02:22,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:02:22,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:02:22,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399814420] [2019-10-15 03:02:22,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:02:22,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:02:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:02:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:02:22,903 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 5 states. [2019-10-15 03:02:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:02:23,024 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-10-15 03:02:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:02:23,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-15 03:02:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:02:23,027 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:02:23,027 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:02:23,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 26 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:02:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:02:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:02:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:02:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:02:23,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2019-10-15 03:02:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:02:23,030 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:02:23,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:02:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:02:23,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:02:23,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:02:23,193 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:02:23,194 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:23,194 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:02:23,194 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:02:23,194 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:02:23,194 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:02:23,194 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-10-15 03:02:23,194 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-10-15 03:02:23,195 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-10-15 03:02:23,195 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-15 03:02:23,195 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-10-15 03:02:23,196 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-10-15 03:02:23,197 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-15 03:02:23,197 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-15 03:02:23,198 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-10-15 03:02:23,198 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-10-15 03:02:23,199 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-10-15 03:02:23,199 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-10-15 03:02:23,199 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-10-15 03:02:23,199 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-15 03:02:23,199 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-10-15 03:02:23,200 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-10-15 03:02:23,200 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-10-15 03:02:23,200 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-10-15 03:02:23,200 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-10-15 03:02:23,200 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-10-15 03:02:23,201 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-15 03:02:23,201 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-10-15 03:02:23,201 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-15 03:02:23,201 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-10-15 03:02:23,202 INFO L446 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-10-15 03:02:23,203 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-10-15 03:02:23,204 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-10-15 03:02:23,204 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-10-15 03:02:23,204 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-15 03:02:23,205 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-10-15 03:02:23,205 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-10-15 03:02:23,207 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-10-15 03:02:23,207 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-10-15 03:02:23,207 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-10-15 03:02:23,208 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-10-15 03:02:23,209 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-15 03:02:23,209 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-10-15 03:02:23,209 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-10-15 03:02:23,209 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-10-15 03:02:23,209 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-10-15 03:02:23,210 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-10-15 03:02:23,210 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-10-15 03:02:23,210 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-10-15 03:02:23,210 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-10-15 03:02:23,210 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-15 03:02:23,211 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-15 03:02:23,211 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-15 03:02:23,211 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-15 03:02:23,211 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-10-15 03:02:23,211 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-15 03:02:23,212 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-10-15 03:02:23,212 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: true [2019-10-15 03:02:23,212 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-15 03:02:23,212 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-10-15 03:02:23,212 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-10-15 03:02:23,213 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-10-15 03:02:23,214 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-10-15 03:02:23,215 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-15 03:02:23,216 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-10-15 03:02:23,216 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-10-15 03:02:23,216 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-10-15 03:02:23,217 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-10-15 03:02:23,218 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-10-15 03:02:23,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:02:23 BoogieIcfgContainer [2019-10-15 03:02:23,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:02:23,247 INFO L168 Benchmark]: Toolchain (without parser) took 7688.61 ms. Allocated memory was 136.3 MB in the beginning and 293.6 MB in the end (delta: 157.3 MB). Free memory was 100.8 MB in the beginning and 229.2 MB in the end (delta: -128.4 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:23,248 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-15 03:02:23,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.78 ms. Allocated memory was 136.3 MB in the beginning and 202.4 MB in the end (delta: 66.1 MB). Free memory was 100.6 MB in the beginning and 176.4 MB in the end (delta: -75.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:23,250 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 173.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:23,251 INFO L168 Benchmark]: RCFGBuilder took 916.05 ms. Allocated memory is still 202.4 MB. Free memory was 173.2 MB in the beginning and 124.3 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:02:23,252 INFO L168 Benchmark]: TraceAbstraction took 6116.49 ms. Allocated memory was 202.4 MB in the beginning and 293.6 MB in the end (delta: 91.2 MB). Free memory was 123.6 MB in the beginning and 229.2 MB in the end (delta: -105.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 03:02:23,255 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 587.78 ms. Allocated memory was 136.3 MB in the beginning and 202.4 MB in the end (delta: 66.1 MB). Free memory was 100.6 MB in the beginning and 176.4 MB in the end (delta: -75.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.83 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 173.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.05 ms. Allocated memory is still 202.4 MB. Free memory was 173.2 MB in the beginning and 124.3 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6116.49 ms. Allocated memory was 202.4 MB in the beginning and 293.6 MB in the end (delta: 91.2 MB). Free memory was 123.6 MB in the beginning and 229.2 MB in the end (delta: -105.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 16 error locations. Result: SAFE, OverallTime: 6.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 750 SDtfs, 1904 SDslu, 849 SDs, 0 SdLazy, 2399 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 39 SyntacticMatches, 57 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 97 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 11 NumberOfFragments, 37 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1141 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 103 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 43375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...