/usr/bin/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:01:12,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:12,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:12,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:12,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:12,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:12,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:12,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:12,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:12,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:12,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:12,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:12,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:12,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:12,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:12,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:12,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:12,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:12,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:12,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:12,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:12,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:12,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:12,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:12,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:12,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:12,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:12,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:12,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:12,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:12,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:12,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:12,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:12,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:12,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:12,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:12,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:12,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:12,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:12,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:12,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:12,736 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-11-07 04:01:12,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:12,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:12,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:12,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:12,752 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:12,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:12,752 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:12,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:12,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:12,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:12,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:12,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:12,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:12,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:12,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:12,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:12,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:12,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:12,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:12,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:12,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:12,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:12,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:12,756 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-11-07 04:01:13,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:13,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:13,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:13,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:13,055 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:13,055 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+nlh-reducer.c [2019-11-07 04:01:13,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61c074d6/35d31841b64b49029290d293a9096000/FLAGbb31a5bc8 [2019-11-07 04:01:13,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:13,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-07 04:01:13,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61c074d6/35d31841b64b49029290d293a9096000/FLAGbb31a5bc8 [2019-11-07 04:01:14,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61c074d6/35d31841b64b49029290d293a9096000 [2019-11-07 04:01:14,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:14,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:14,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:14,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:14,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:14,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1adb9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14, skipping insertion in model container [2019-11-07 04:01:14,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,120 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:14,175 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:14,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:14,390 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:14,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:14,545 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:14,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14 WrapperNode [2019-11-07 04:01:14,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:14,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:14,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:14,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:14,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (1/1) ... [2019-11-07 04:01:14,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:14,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:14,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:14,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:14,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (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-11-07 04:01:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:14,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:14,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:14,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:15,082 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:15,082 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:01:15,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:15 BoogieIcfgContainer [2019-11-07 04:01:15,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:15,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:15,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:15,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:15,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:14" (1/3) ... [2019-11-07 04:01:15,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221bd654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:15, skipping insertion in model container [2019-11-07 04:01:15,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:14" (2/3) ... [2019-11-07 04:01:15,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@221bd654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:15, skipping insertion in model container [2019-11-07 04:01:15,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:15" (3/3) ... [2019-11-07 04:01:15,092 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-07 04:01:15,102 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:15,117 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-07 04:01:15,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-07 04:01:15,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:15,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:15,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:15,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:15,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:15,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:15,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:15,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-11-07 04:01:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:15,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:15,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:15,190 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2019-11-07 04:01:15,202 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:15,202 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098620654] [2019-11-07 04:01:15,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:15,410 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098620654] [2019-11-07 04:01:15,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:15,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:15,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969793345] [2019-11-07 04:01:15,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:15,422 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:15,446 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-11-07 04:01:15,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:15,709 INFO L93 Difference]: Finished difference Result 132 states and 175 transitions. [2019-11-07 04:01:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:15,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:15,730 INFO L225 Difference]: With dead ends: 132 [2019-11-07 04:01:15,731 INFO L226 Difference]: Without dead ends: 112 [2019-11-07 04:01:15,737 INFO L630 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-11-07 04:01:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-07 04:01:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2019-11-07 04:01:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 04:01:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 04:01:15,799 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2019-11-07 04:01:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:15,800 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 04:01:15,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 04:01:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:15,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:15,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:15,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2019-11-07 04:01:15,803 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:15,803 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598435968] [2019-11-07 04:01:15,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:15,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:15,887 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598435968] [2019-11-07 04:01:15,887 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:15,887 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:15,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214283331] [2019-11-07 04:01:15,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:15,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:15,890 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2019-11-07 04:01:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:15,990 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-07 04:01:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:15,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:15,993 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:01:15,994 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:15,995 INFO L630 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-11-07 04:01:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-07 04:01:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 04:01:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 04:01:16,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2019-11-07 04:01:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,012 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 04:01:16,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 04:01:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 04:01:16,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,016 INFO L82 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2019-11-07 04:01:16,016 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,017 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789067069] [2019-11-07 04:01:16,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789067069] [2019-11-07 04:01:16,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:16,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274398116] [2019-11-07 04:01:16,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:16,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:16,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:16,095 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-11-07 04:01:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,184 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-07 04:01:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:16,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 04:01:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,188 INFO L225 Difference]: With dead ends: 72 [2019-11-07 04:01:16,188 INFO L226 Difference]: Without dead ends: 70 [2019-11-07 04:01:16,191 INFO L630 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-11-07 04:01:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-07 04:01:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-11-07 04:01:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-07 04:01:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-07 04:01:16,207 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-11-07 04:01:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,207 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-07 04:01:16,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-07 04:01:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:16,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,212 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2019-11-07 04:01:16,213 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,213 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294471256] [2019-11-07 04:01:16,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,273 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294471256] [2019-11-07 04:01:16,273 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,273 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:16,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664143678] [2019-11-07 04:01:16,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:16,274 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:16,275 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-11-07 04:01:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,375 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-07 04:01:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:16,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,377 INFO L225 Difference]: With dead ends: 70 [2019-11-07 04:01:16,377 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 04:01:16,378 INFO L630 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-11-07 04:01:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 04:01:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-11-07 04:01:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 04:01:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-07 04:01:16,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2019-11-07 04:01:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,385 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-07 04:01:16,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-07 04:01:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:16,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,387 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2019-11-07 04:01:16,388 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,388 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027601556] [2019-11-07 04:01:16,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,439 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027601556] [2019-11-07 04:01:16,440 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,440 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697616666] [2019-11-07 04:01:16,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:16,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:16,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:16,441 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-07 04:01:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,537 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-07 04:01:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:16,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,538 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:01:16,539 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:16,539 INFO L630 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-11-07 04:01:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-07 04:01:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-07 04:01:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-07 04:01:16,545 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2019-11-07 04:01:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,546 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-07 04:01:16,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-07 04:01:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:16,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,548 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2019-11-07 04:01:16,548 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,549 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114267624] [2019-11-07 04:01:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114267624] [2019-11-07 04:01:16,603 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,603 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:16,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137872745] [2019-11-07 04:01:16,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:16,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:16,605 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-07 04:01:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,743 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-11-07 04:01:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:16,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 04:01:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,745 INFO L225 Difference]: With dead ends: 111 [2019-11-07 04:01:16,746 INFO L226 Difference]: Without dead ends: 109 [2019-11-07 04:01:16,746 INFO L630 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-11-07 04:01:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-07 04:01:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-11-07 04:01:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-07 04:01:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-07 04:01:16,766 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-11-07 04:01:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,766 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-07 04:01:16,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-07 04:01:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:16,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,774 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2019-11-07 04:01:16,775 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647639814] [2019-11-07 04:01:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,845 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647639814] [2019-11-07 04:01:16,846 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,846 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:16,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981996175] [2019-11-07 04:01:16,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:16,847 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:16,847 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-07 04:01:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:16,929 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-07 04:01:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:16,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 04:01:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:16,931 INFO L225 Difference]: With dead ends: 64 [2019-11-07 04:01:16,931 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:01:16,932 INFO L630 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-11-07 04:01:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:01:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-11-07 04:01:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 04:01:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-07 04:01:16,940 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2019-11-07 04:01:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:16,940 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-07 04:01:16,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-07 04:01:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:16,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:16,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:16,946 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2019-11-07 04:01:16,948 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:16,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251868807] [2019-11-07 04:01:16,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:17,014 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251868807] [2019-11-07 04:01:17,014 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,014 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:17,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191327225] [2019-11-07 04:01:17,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:17,015 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:17,019 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-11-07 04:01:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,082 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-11-07 04:01:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:17,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 04:01:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,083 INFO L225 Difference]: With dead ends: 60 [2019-11-07 04:01:17,083 INFO L226 Difference]: Without dead ends: 56 [2019-11-07 04:01:17,084 INFO L630 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-11-07 04:01:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-07 04:01:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-11-07 04:01:17,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-07 04:01:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-07 04:01:17,089 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2019-11-07 04:01:17,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,090 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-07 04:01:17,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-07 04:01:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:17,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,092 INFO L82 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2019-11-07 04:01:17,092 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,092 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41878049] [2019-11-07 04:01:17,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:17,155 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41878049] [2019-11-07 04:01:17,155 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,155 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:17,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503053387] [2019-11-07 04:01:17,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:17,156 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:17,157 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-11-07 04:01:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,269 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-11-07 04:01:17,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:17,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,271 INFO L225 Difference]: With dead ends: 94 [2019-11-07 04:01:17,271 INFO L226 Difference]: Without dead ends: 92 [2019-11-07 04:01:17,272 INFO L630 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-11-07 04:01:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-07 04:01:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-11-07 04:01:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-07 04:01:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-07 04:01:17,278 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-11-07 04:01:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,278 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-07 04:01:17,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-07 04:01:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:17,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,280 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2019-11-07 04:01:17,281 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,281 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654355617] [2019-11-07 04:01:17,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:17,329 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654355617] [2019-11-07 04:01:17,329 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,329 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:17,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426609916] [2019-11-07 04:01:17,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:17,332 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:17,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:17,332 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-11-07 04:01:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,423 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-11-07 04:01:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:17,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,425 INFO L225 Difference]: With dead ends: 71 [2019-11-07 04:01:17,425 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 04:01:17,426 INFO L630 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-11-07 04:01:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 04:01:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-07 04:01:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-07 04:01:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-07 04:01:17,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2019-11-07 04:01:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-07 04:01:17,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-07 04:01:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:17,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,434 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2019-11-07 04:01:17,434 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,435 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453298139] [2019-11-07 04:01:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:17,488 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453298139] [2019-11-07 04:01:17,489 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,489 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858605360] [2019-11-07 04:01:17,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:17,490 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:17,491 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-11-07 04:01:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,570 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-11-07 04:01:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:17,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,571 INFO L225 Difference]: With dead ends: 52 [2019-11-07 04:01:17,571 INFO L226 Difference]: Without dead ends: 50 [2019-11-07 04:01:17,571 INFO L630 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-11-07 04:01:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-07 04:01:17,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-11-07 04:01:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-07 04:01:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-07 04:01:17,577 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 16 [2019-11-07 04:01:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,578 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-07 04:01:17,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,584 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-07 04:01:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:17,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2019-11-07 04:01:17,592 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,592 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351422638] [2019-11-07 04:01:17,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:17,690 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351422638] [2019-11-07 04:01:17,690 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,690 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:17,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497445840] [2019-11-07 04:01:17,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:17,693 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:17,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:17,693 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-11-07 04:01:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,762 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-07 04:01:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:17,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,763 INFO L225 Difference]: With dead ends: 49 [2019-11-07 04:01:17,763 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 04:01:17,764 INFO L630 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-11-07 04:01:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 04:01:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-11-07 04:01:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-07 04:01:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-07 04:01:17,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-11-07 04:01:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,768 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-07 04:01:17,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-07 04:01:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:17,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2019-11-07 04:01:17,771 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,772 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935349966] [2019-11-07 04:01:17,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:17,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-11-07 04:01:17,834 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935349966] [2019-11-07 04:01:17,835 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:17,835 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:17,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372764304] [2019-11-07 04:01:17,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:17,836 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:17,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:17,836 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-07 04:01:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,926 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-07 04:01:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:17,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,928 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:01:17,928 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:17,928 INFO L630 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-11-07 04:01:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-11-07 04:01:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 04:01:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-07 04:01:17,932 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-11-07 04:01:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,933 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-07 04:01:17,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-07 04:01:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:17,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:17,934 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2019-11-07 04:01:17,935 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,935 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352911852] [2019-11-07 04:01:17,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:18,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352911852] [2019-11-07 04:01:18,010 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:18,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:18,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448837590] [2019-11-07 04:01:18,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:18,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:18,011 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-07 04:01:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:18,098 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-07 04:01:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:18,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:18,099 INFO L225 Difference]: With dead ends: 56 [2019-11-07 04:01:18,099 INFO L226 Difference]: Without dead ends: 54 [2019-11-07 04:01:18,100 INFO L630 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-11-07 04:01:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-07 04:01:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-11-07 04:01:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 04:01:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-07 04:01:18,103 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2019-11-07 04:01:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:18,104 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-07 04:01:18,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-07 04:01:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:18,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:18,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:18,105 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2019-11-07 04:01:18,106 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:18,106 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928755719] [2019-11-07 04:01:18,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:18,153 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928755719] [2019-11-07 04:01:18,153 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:18,153 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:18,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243549063] [2019-11-07 04:01:18,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:18,154 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:18,155 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-11-07 04:01:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:18,210 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-07 04:01:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:18,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:18,211 INFO L225 Difference]: With dead ends: 40 [2019-11-07 04:01:18,211 INFO L226 Difference]: Without dead ends: 36 [2019-11-07 04:01:18,212 INFO L630 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-11-07 04:01:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-07 04:01:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-07 04:01:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-07 04:01:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-07 04:01:18,215 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2019-11-07 04:01:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:18,215 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-07 04:01:18,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-07 04:01:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:01:18,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:18,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:18,217 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2019-11-07 04:01:18,217 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:18,217 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741445443] [2019-11-07 04:01:18,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:18,263 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741445443] [2019-11-07 04:01:18,263 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:18,263 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:18,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892417447] [2019-11-07 04:01:18,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:18,264 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:18,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:18,265 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-11-07 04:01:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:18,336 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-07 04:01:18,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:18,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 04:01:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:18,337 INFO L225 Difference]: With dead ends: 51 [2019-11-07 04:01:18,338 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 04:01:18,338 INFO L630 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-11-07 04:01:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 04:01:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2019-11-07 04:01:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 04:01:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-07 04:01:18,342 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2019-11-07 04:01:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:18,342 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-07 04:01:18,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-07 04:01:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:18,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:18,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:18,343 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2019-11-07 04:01:18,344 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:18,344 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879344607] [2019-11-07 04:01:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:18,381 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879344607] [2019-11-07 04:01:18,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:18,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:18,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083243816] [2019-11-07 04:01:18,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:18,382 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:18,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:18,383 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-11-07 04:01:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:18,470 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-07 04:01:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:18,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-07 04:01:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:18,472 INFO L225 Difference]: With dead ends: 55 [2019-11-07 04:01:18,473 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 04:01:18,473 INFO L630 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-11-07 04:01:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 04:01:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-11-07 04:01:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-07 04:01:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-07 04:01:18,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-11-07 04:01:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:18,486 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-07 04:01:18,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-07 04:01:18,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 04:01:18,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:18,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:18,488 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2019-11-07 04:01:18,489 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:18,489 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764713182] [2019-11-07 04:01:18,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:18,514 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764713182] [2019-11-07 04:01:18,515 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:18,515 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:18,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999979443] [2019-11-07 04:01:18,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:18,516 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:18,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:18,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:18,516 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-11-07 04:01:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:18,556 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-07 04:01:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:18,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 04:01:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:18,557 INFO L225 Difference]: With dead ends: 36 [2019-11-07 04:01:18,557 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:18,558 INFO L630 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-11-07 04:01:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:18,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-07 04:01:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:18,560 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:18,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:18,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:18,975 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:18,975 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:18,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:18,976 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:18,976 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:18,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:18,976 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-07 04:01:18,977 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-11-07 04:01:18,977 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-07 04:01:18,977 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-07 04:01:18,977 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-07 04:01:18,977 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-07 04:01:18,978 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-07 04:01:18,978 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-07 04:01:18,978 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-07 04:01:18,978 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-07 04:01:18,978 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-07 04:01:18,979 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-07 04:01:18,980 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-07 04:01:18,980 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-07 04:01:18,980 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-11-07 04:01:18,980 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-07 04:01:18,980 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-07 04:01:18,980 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-07 04:01:18,981 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-07 04:01:18,981 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-07 04:01:18,981 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) 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-11-07 04:01:18,981 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-11-07 04:01:18,981 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-07 04:01:18,981 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-07 04:01:18,982 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-07 04:01:18,982 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-07 04:01:18,982 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-07 04:01:18,982 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-07 04:01:18,982 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-07 04:01:18,982 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-07 04:01:18,983 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-07 04:01:18,983 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-07 04:01:18,983 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-07 04:01:18,983 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-07 04:01:18,983 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-07 04:01:18,984 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-07 04:01:18,985 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-07 04:01:18,986 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-07 04:01:18,986 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-07 04:01:18,986 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-07 04:01:18,986 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-07 04:01:18,986 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-07 04:01:18,987 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) 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-11-07 04:01:18,987 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-07 04:01:18,987 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-07 04:01:18,987 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-07 04:01:18,987 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-07 04:01:18,988 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-07 04:01:18,988 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-07 04:01:18,988 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-07 04:01:18,988 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-07 04:01:18,988 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-07 04:01:18,989 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-07 04:01:19,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:19 BoogieIcfgContainer [2019-11-07 04:01:19,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:19,014 INFO L168 Benchmark]: Toolchain (without parser) took 4918.55 ms. Allocated memory was 144.2 MB in the beginning and 248.5 MB in the end (delta: 104.3 MB). Free memory was 102.2 MB in the beginning and 149.7 MB in the end (delta: -47.5 MB). Peak memory consumption was 56.8 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,015 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.37 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 180.5 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,017 INFO L168 Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,017 INFO L168 Benchmark]: RCFGBuilder took 498.88 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 154.7 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,018 INFO L168 Benchmark]: TraceAbstraction took 3926.34 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 154.0 MB in the beginning and 149.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:19,022 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.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.37 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 180.5 MB in the end (delta: -78.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.92 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 178.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 498.88 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 154.7 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3926.34 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 154.0 MB in the beginning and 149.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 17 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 783 SDtfs, 1345 SDslu, 775 SDs, 0 SdLazy, 998 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 69 HoareAnnotationTreeSize, 9 FomulaSimplifications, 138182 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3250 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 10120 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...