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.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:58:42,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:42,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:43,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:43,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:43,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:43,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:43,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:43,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:43,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:43,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:43,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:43,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:43,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:43,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:43,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:43,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:43,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:43,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:43,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:43,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:43,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:43,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:43,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:43,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:43,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:43,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:43,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:43,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:43,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:43,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:43,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:43,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:43,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:43,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:43,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:43,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:43,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:43,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:43,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:43,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:43,059 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-13 22:58:43,078 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:43,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:43,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:43,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:43,081 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:43,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:43,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:43,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:43,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:43,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:43,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:43,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:43,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:43,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:43,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:43,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:43,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:43,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:43,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:43,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:43,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:43,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:43,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:43,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:43,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:43,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:43,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:43,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:43,087 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-13 22:58:43,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:43,375 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:43,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:43,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:43,382 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:43,382 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.v+lhb-reducer.c [2019-10-13 22:58:43,454 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5029271/9a0ea12076e6437cb10f7ab788ff7f4b/FLAGcce9a8674 [2019-10-13 22:58:43,973 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:43,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-13 22:58:43,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5029271/9a0ea12076e6437cb10f7ab788ff7f4b/FLAGcce9a8674 [2019-10-13 22:58:44,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc5029271/9a0ea12076e6437cb10f7ab788ff7f4b [2019-10-13 22:58:44,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:44,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:44,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:44,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:44,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:44,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cee117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44, skipping insertion in model container [2019-10-13 22:58:44,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,306 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:44,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:44,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:44,544 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:44,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:44,692 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:44,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44 WrapperNode [2019-10-13 22:58:44,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:44,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:44,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:44,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:44,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (1/1) ... [2019-10-13 22:58:44,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:44,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:44,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:44,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:44,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (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-13 22:58:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:44,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:44,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:44,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:45,268 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:45,268 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:58:45,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:45 BoogieIcfgContainer [2019-10-13 22:58:45,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:45,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:45,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:45,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:45,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:44" (1/3) ... [2019-10-13 22:58:45,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec64291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:45, skipping insertion in model container [2019-10-13 22:58:45,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:44" (2/3) ... [2019-10-13 22:58:45,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec64291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:45, skipping insertion in model container [2019-10-13 22:58:45,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:45" (3/3) ... [2019-10-13 22:58:45,277 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-13 22:58:45,284 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:45,292 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-13 22:58:45,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-13 22:58:45,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:45,331 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:45,331 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:45,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:45,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:45,332 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:45,332 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:45,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-10-13 22:58:45,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:58:45,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:45,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:45,364 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2019-10-13 22:58:45,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:45,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810581890] [2019-10-13 22:58:45,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:45,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:45,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:45,561 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-13 22:58:45,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810581890] [2019-10-13 22:58:45,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:45,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:45,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633381167] [2019-10-13 22:58:45,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:45,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:45,592 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-10-13 22:58:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:45,839 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2019-10-13 22:58:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:45,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:58:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:45,853 INFO L225 Difference]: With dead ends: 130 [2019-10-13 22:58:45,854 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 22:58:45,857 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-13 22:58:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 22:58:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2019-10-13 22:58:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 22:58:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-13 22:58:45,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2019-10-13 22:58:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:45,928 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-13 22:58:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-13 22:58:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:58:45,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:45,930 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:45,931 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2019-10-13 22:58:45,934 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:45,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616853410] [2019-10-13 22:58:45,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:45,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:45,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:46,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616853410] [2019-10-13 22:58:46,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:46,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:46,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793985418] [2019-10-13 22:58:46,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:46,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:46,055 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2019-10-13 22:58:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:46,173 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-10-13 22:58:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:46,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:58:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:46,178 INFO L225 Difference]: With dead ends: 110 [2019-10-13 22:58:46,179 INFO L226 Difference]: Without dead ends: 108 [2019-10-13 22:58:46,180 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-13 22:58:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-13 22:58:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2019-10-13 22:58:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 22:58:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-10-13 22:58:46,199 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2019-10-13 22:58:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:46,199 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-10-13 22:58:46,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:46,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-10-13 22:58:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:58:46,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:46,202 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:46,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:46,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2019-10-13 22:58:46,204 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:46,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464047047] [2019-10-13 22:58:46,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:46,297 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-13 22:58:46,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464047047] [2019-10-13 22:58:46,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:46,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:46,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767521661] [2019-10-13 22:58:46,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:46,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:46,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:46,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:46,300 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-10-13 22:58:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:46,418 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-10-13 22:58:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:46,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 22:58:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:46,420 INFO L225 Difference]: With dead ends: 72 [2019-10-13 22:58:46,420 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 22:58:46,420 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-13 22:58:46,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 22:58:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-10-13 22:58:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 22:58:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 22:58:46,428 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2019-10-13 22:58:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:46,429 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 22:58:46,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 22:58:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:58:46,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:46,430 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:46,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:46,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2019-10-13 22:58:46,431 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:46,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296804007] [2019-10-13 22:58:46,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:46,483 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-13 22:58:46,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296804007] [2019-10-13 22:58:46,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:46,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:46,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018894669] [2019-10-13 22:58:46,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:46,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:46,486 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-10-13 22:58:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:46,580 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-13 22:58:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:46,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 22:58:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:46,581 INFO L225 Difference]: With dead ends: 70 [2019-10-13 22:58:46,581 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 22:58:46,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-13 22:58:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 22:58:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-13 22:58:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 22:58:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 22:58:46,589 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2019-10-13 22:58:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:46,589 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 22:58:46,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 22:58:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:46,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:46,590 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:46,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:46,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2019-10-13 22:58:46,592 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:46,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796405614] [2019-10-13 22:58:46,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:46,652 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-13 22:58:46,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796405614] [2019-10-13 22:58:46,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:46,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:46,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793954053] [2019-10-13 22:58:46,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:46,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:46,656 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-10-13 22:58:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:46,783 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-10-13 22:58:46,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:46,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 22:58:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:46,786 INFO L225 Difference]: With dead ends: 115 [2019-10-13 22:58:46,786 INFO L226 Difference]: Without dead ends: 113 [2019-10-13 22:58:46,787 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-13 22:58:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-13 22:58:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 64. [2019-10-13 22:58:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 22:58:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-10-13 22:58:46,804 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2019-10-13 22:58:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:46,805 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-10-13 22:58:46,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-10-13 22:58:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:46,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:46,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:46,809 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:46,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2019-10-13 22:58:46,810 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:46,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305081039] [2019-10-13 22:58:46,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:46,871 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-13 22:58:46,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305081039] [2019-10-13 22:58:46,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:46,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:46,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538986529] [2019-10-13 22:58:46,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:46,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:46,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:46,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:46,874 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-10-13 22:58:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:46,977 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-10-13 22:58:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:46,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 22:58:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:46,978 INFO L225 Difference]: With dead ends: 100 [2019-10-13 22:58:46,979 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 22:58:46,979 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-13 22:58:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 22:58:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2019-10-13 22:58:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 22:58:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-10-13 22:58:46,986 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2019-10-13 22:58:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:46,986 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-10-13 22:58:46,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-10-13 22:58:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:46,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:46,987 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:46,988 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2019-10-13 22:58:46,989 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:46,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282425579] [2019-10-13 22:58:46,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:46,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,019 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-13 22:58:47,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282425579] [2019-10-13 22:58:47,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:47,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204789372] [2019-10-13 22:58:47,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:47,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:47,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:47,021 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-10-13 22:58:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,091 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-10-13 22:58:47,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:47,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 22:58:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,093 INFO L225 Difference]: With dead ends: 64 [2019-10-13 22:58:47,093 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 22:58:47,093 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-13 22:58:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 22:58:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-10-13 22:58:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 22:58:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-10-13 22:58:47,103 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2019-10-13 22:58:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,103 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-10-13 22:58:47,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-10-13 22:58:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:47,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,106 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2019-10-13 22:58:47,107 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064261229] [2019-10-13 22:58:47,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,184 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-13 22:58:47,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064261229] [2019-10-13 22:58:47,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:47,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359174003] [2019-10-13 22:58:47,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:47,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:47,188 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-10-13 22:58:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,236 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-10-13 22:58:47,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:47,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 22:58:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,237 INFO L225 Difference]: With dead ends: 60 [2019-10-13 22:58:47,238 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 22:58:47,238 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-13 22:58:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 22:58:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-10-13 22:58:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 22:58:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 22:58:47,250 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-10-13 22:58:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,251 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 22:58:47,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 22:58:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:47,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,254 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,255 INFO L82 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2019-10-13 22:58:47,255 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88697633] [2019-10-13 22:58:47,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,355 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-13 22:58:47,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88697633] [2019-10-13 22:58:47,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714034256] [2019-10-13 22:58:47,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,359 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-10-13 22:58:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,485 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-10-13 22:58:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:47,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,487 INFO L225 Difference]: With dead ends: 93 [2019-10-13 22:58:47,487 INFO L226 Difference]: Without dead ends: 91 [2019-10-13 22:58:47,488 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-13 22:58:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-13 22:58:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-10-13 22:58:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 22:58:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-13 22:58:47,493 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-10-13 22:58:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,494 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-13 22:58:47,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-13 22:58:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:47,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,495 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2019-10-13 22:58:47,497 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013526773] [2019-10-13 22:58:47,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,560 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-13 22:58:47,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013526773] [2019-10-13 22:58:47,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770572041] [2019-10-13 22:58:47,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,563 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-10-13 22:58:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,674 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-10-13 22:58:47,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:47,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,676 INFO L225 Difference]: With dead ends: 83 [2019-10-13 22:58:47,676 INFO L226 Difference]: Without dead ends: 81 [2019-10-13 22:58:47,677 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-13 22:58:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-13 22:58:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2019-10-13 22:58:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 22:58:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-13 22:58:47,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-13 22:58:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,681 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-13 22:58:47,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-13 22:58:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:47,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,682 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,683 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2019-10-13 22:58:47,684 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534975391] [2019-10-13 22:58:47,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,684 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,719 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-13 22:58:47,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534975391] [2019-10-13 22:58:47,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403345868] [2019-10-13 22:58:47,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,722 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-10-13 22:58:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,799 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-13 22:58:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:47,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,800 INFO L225 Difference]: With dead ends: 69 [2019-10-13 22:58:47,801 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 22:58:47,801 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-13 22:58:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 22:58:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2019-10-13 22:58:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 22:58:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-10-13 22:58:47,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 16 [2019-10-13 22:58:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,805 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-10-13 22:58:47,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-10-13 22:58:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:47,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,807 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2019-10-13 22:58:47,808 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342009735] [2019-10-13 22:58:47,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,834 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-13 22:58:47,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342009735] [2019-10-13 22:58:47,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281254806] [2019-10-13 22:58:47,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,837 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-10-13 22:58:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:47,921 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-10-13 22:58:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:47,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:47,922 INFO L225 Difference]: With dead ends: 50 [2019-10-13 22:58:47,922 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 22:58:47,922 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-13 22:58:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 22:58:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-13 22:58:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 22:58:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-13 22:58:47,928 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 16 [2019-10-13 22:58:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:47,928 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-13 22:58:47,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-13 22:58:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:47,934 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,935 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2019-10-13 22:58:47,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847546559] [2019-10-13 22:58:47,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,962 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-13 22:58:47,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847546559] [2019-10-13 22:58:47,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:47,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084519399] [2019-10-13 22:58:47,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:47,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:47,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:47,965 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-10-13 22:58:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,045 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-10-13 22:58:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:48,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,047 INFO L225 Difference]: With dead ends: 68 [2019-10-13 22:58:48,047 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 22:58:48,047 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-13 22:58:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 22:58:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-10-13 22:58:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 22:58:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 22:58:48,052 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-10-13 22:58:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,052 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 22:58:48,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,053 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 22:58:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:48,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,054 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,054 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2019-10-13 22:58:48,055 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443696127] [2019-10-13 22:58:48,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,124 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-13 22:58:48,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443696127] [2019-10-13 22:58:48,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873790245] [2019-10-13 22:58:48,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,127 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-13 22:58:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,207 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-10-13 22:58:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:48,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,208 INFO L225 Difference]: With dead ends: 58 [2019-10-13 22:58:48,208 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 22:58:48,209 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-13 22:58:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 22:58:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-10-13 22:58:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 22:58:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-13 22:58:48,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-10-13 22:58:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,214 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-13 22:58:48,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-13 22:58:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:48,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,215 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,220 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,220 INFO L82 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2019-10-13 22:58:48,220 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998210583] [2019-10-13 22:58:48,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,275 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-13 22:58:48,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998210583] [2019-10-13 22:58:48,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083692267] [2019-10-13 22:58:48,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,278 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-10-13 22:58:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,337 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-13 22:58:48,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:48,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,338 INFO L225 Difference]: With dead ends: 42 [2019-10-13 22:58:48,338 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 22:58:48,339 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-13 22:58:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 22:58:48,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 22:58:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 22:58:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-10-13 22:58:48,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2019-10-13 22:58:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,345 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-10-13 22:58:48,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-10-13 22:58:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:48,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,349 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-13 22:58:48,349 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2019-10-13 22:58:48,350 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374124829] [2019-10-13 22:58:48,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,394 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-13 22:58:48,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374124829] [2019-10-13 22:58:48,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082994381] [2019-10-13 22:58:48,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,396 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-10-13 22:58:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,495 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-10-13 22:58:48,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:48,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 22:58:48,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,497 INFO L225 Difference]: With dead ends: 53 [2019-10-13 22:58:48,497 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 22:58:48,498 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-13 22:58:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 22:58:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-10-13 22:58:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 22:58:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 22:58:48,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 18 [2019-10-13 22:58:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,502 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 22:58:48,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 22:58:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:58:48,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,503 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-13 22:58:48,504 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2019-10-13 22:58:48,504 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850596658] [2019-10-13 22:58:48,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,549 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-13 22:58:48,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850596658] [2019-10-13 22:58:48,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:48,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983222061] [2019-10-13 22:58:48,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:48,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:48,551 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-10-13 22:58:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,647 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-13 22:58:48,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:48,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 22:58:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,651 INFO L225 Difference]: With dead ends: 55 [2019-10-13 22:58:48,651 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 22:58:48,652 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-13 22:58:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 22:58:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-10-13 22:58:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 22:58:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-13 22:58:48,657 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2019-10-13 22:58:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,657 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-13 22:58:48,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-13 22:58:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:58:48,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,658 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-13 22:58:48,658 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2019-10-13 22:58:48,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815796783] [2019-10-13 22:58:48,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,686 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-13 22:58:48,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815796783] [2019-10-13 22:58:48,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:48,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662580172] [2019-10-13 22:58:48,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:48,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:48,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:48,689 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-10-13 22:58:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,727 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-13 22:58:48,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:48,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 22:58:48,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,728 INFO L225 Difference]: With dead ends: 36 [2019-10-13 22:58:48,728 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:58:48,729 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-13 22:58:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:58:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:58:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:58:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:58:48,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-13 22:58:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,730 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:58:48,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:58:48,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:58:48,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:58:49,024 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:58:49,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:58:49,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:58:49,025 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 22:58:49,025 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:58:49,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 22:58:49,025 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-13 22:58:49,025 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-10-13 22:58:49,026 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-10-13 22:58:49,027 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-10-13 22:58:49,027 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-10-13 22:58:49,027 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-10-13 22:58:49,027 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-10-13 22:58:49,027 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-10-13 22:58:49,028 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-10-13 22:58:49,028 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-10-13 22:58:49,028 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-10-13 22:58:49,028 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-10-13 22:58:49,028 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-10-13 22:58:49,029 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-10-13 22:58:49,029 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-13 22:58:49,029 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) 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-13 22:58:49,029 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 22:58:49,029 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-10-13 22:58:49,030 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-10-13 22:58:49,030 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-13 22:58:49,030 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-10-13 22:58:49,030 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-10-13 22:58:49,031 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-10-13 22:58:49,032 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-10-13 22:58:49,033 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-13 22:58:49,033 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-10-13 22:58:49,033 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-10-13 22:58:49,033 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-13 22:58:49,033 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-10-13 22:58:49,033 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-10-13 22:58:49,034 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-10-13 22:58:49,035 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-13 22:58:49,036 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-10-13 22:58:49,036 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-10-13 22:58:49,036 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 22:58:49,036 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-10-13 22:58:49,036 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-10-13 22:58:49,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:58:49 BoogieIcfgContainer [2019-10-13 22:58:49,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 22:58:49,057 INFO L168 Benchmark]: Toolchain (without parser) took 4766.75 ms. Allocated memory was 145.8 MB in the beginning and 244.8 MB in the end (delta: 99.1 MB). Free memory was 102.4 MB in the beginning and 118.4 MB in the end (delta: -16.0 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,058 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.96 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 183.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,059 INFO L168 Benchmark]: Boogie Preprocessor took 52.99 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,060 INFO L168 Benchmark]: RCFGBuilder took 521.60 ms. Allocated memory is still 203.9 MB. Free memory was 180.7 MB in the beginning and 155.4 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,061 INFO L168 Benchmark]: TraceAbstraction took 3784.01 ms. Allocated memory was 203.9 MB in the beginning and 244.8 MB in the end (delta: 40.9 MB). Free memory was 155.4 MB in the beginning and 118.4 MB in the end (delta: 37.0 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:49,064 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 403.96 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 183.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.99 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 521.60 ms. Allocated memory is still 203.9 MB. Free memory was 180.7 MB in the beginning and 155.4 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3784.01 ms. Allocated memory was 203.9 MB in the beginning and 244.8 MB in the end (delta: 40.9 MB). Free memory was 155.4 MB in the beginning and 118.4 MB in the end (delta: 37.0 MB). Peak memory consumption was 77.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 18 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 834 SDtfs, 1350 SDslu, 875 SDs, 0 SdLazy, 1095 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 50 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2628 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 10210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...