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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:25:33,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:33,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:33,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:33,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:33,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:33,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:33,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:33,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:33,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:33,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:33,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:33,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:33,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:33,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:33,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:33,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:33,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:33,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:33,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:33,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:33,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:33,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:33,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:33,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:33,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:33,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:33,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:33,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:33,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:33,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:33,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:33,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:33,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:33,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:33,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:33,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:33,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:33,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:33,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:33,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:33,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:25:33,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:33,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:33,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:33,751 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:33,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:33,753 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:33,753 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:33,753 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:33,754 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:33,754 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:33,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:33,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:33,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:33,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:33,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:33,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:33,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:33,756 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:33,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:33,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:33,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:33,757 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:33,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:33,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:33,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:33,758 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:33,758 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:33,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:33,758 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:33,759 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:33,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:33,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:33,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:33,806 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:33,807 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:33,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-20 13:25:33,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca74a7c60/953ceb03b15b4aacb9c79fb41f1e5ddc/FLAGcc8842996 [2019-09-20 13:25:34,452 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:34,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-20 13:25:34,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca74a7c60/953ceb03b15b4aacb9c79fb41f1e5ddc/FLAGcc8842996 [2019-09-20 13:25:34,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca74a7c60/953ceb03b15b4aacb9c79fb41f1e5ddc [2019-09-20 13:25:34,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:34,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:34,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:34,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:34,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:34,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:34" (1/1) ... [2019-09-20 13:25:34,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6712ea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:34, skipping insertion in model container [2019-09-20 13:25:34,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:34" (1/1) ... [2019-09-20 13:25:34,715 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:34,827 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:35,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:35,650 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:36,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:36,032 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:36,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36 WrapperNode [2019-09-20 13:25:36,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:36,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:36,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:36,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:36,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (1/1) ... [2019-09-20 13:25:36,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:36,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:36,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:36,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:36,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (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-09-20 13:25:36,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:36,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:36,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:36,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:36,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:36,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:38,899 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:38,900 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:25:38,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:38 BoogieIcfgContainer [2019-09-20 13:25:38,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:38,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:38,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:38,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:38,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:34" (1/3) ... [2019-09-20 13:25:38,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45712ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:38, skipping insertion in model container [2019-09-20 13:25:38,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:36" (2/3) ... [2019-09-20 13:25:38,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45712ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:38, skipping insertion in model container [2019-09-20 13:25:38,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:38" (3/3) ... [2019-09-20 13:25:38,922 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-20 13:25:38,936 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:38,947 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-20 13:25:38,963 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-20 13:25:38,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:38,989 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:38,989 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:38,989 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:38,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:38,990 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:38,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:38,990 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-20 13:25:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 13:25:39,029 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,030 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,032 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-20 13:25:39,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:39,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:39,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:39,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:39,282 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-20 13:25:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:40,695 INFO L93 Difference]: Finished difference Result 484 states and 894 transitions. [2019-09-20 13:25:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:40,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-20 13:25:40,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:40,713 INFO L225 Difference]: With dead ends: 484 [2019-09-20 13:25:40,714 INFO L226 Difference]: Without dead ends: 301 [2019-09-20 13:25:40,716 INFO L636 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-09-20 13:25:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-20 13:25:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-20 13:25:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-20 13:25:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-20 13:25:40,778 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-20 13:25:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:40,779 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-20 13:25:40,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-20 13:25:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 13:25:40,780 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:40,780 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:40,780 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-20 13:25:40,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:40,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:40,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:40,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:40,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:40,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:40,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:40,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:40,902 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-20 13:25:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:41,343 INFO L93 Difference]: Finished difference Result 299 states and 362 transitions. [2019-09-20 13:25:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:41,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 13:25:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:41,350 INFO L225 Difference]: With dead ends: 299 [2019-09-20 13:25:41,351 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:25:41,352 INFO L636 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-09-20 13:25:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:25:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-20 13:25:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-20 13:25:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-20 13:25:41,379 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-20 13:25:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:41,379 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-20 13:25:41,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-20 13:25:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-20 13:25:41,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:41,390 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:41,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:41,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:41,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-20 13:25:41,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:41,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:43,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:43,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-20 13:25:43,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:43,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-20 13:25:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-20 13:25:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 13:25:43,927 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-20 13:25:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:45,226 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-20 13:25:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-20 13:25:45,227 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-20 13:25:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:45,231 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:25:45,231 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 13:25:45,233 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-20 13:25:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 13:25:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-20 13:25:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 13:25:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-20 13:25:45,258 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-20 13:25:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:45,259 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-20 13:25:45,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-20 13:25:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-20 13:25:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-20 13:25:45,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:45,271 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:45,272 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-20 13:25:45,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:45,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:45,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:46,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:46,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:46,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:46,343 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-20 13:25:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:46,991 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-09-20 13:25:46,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:46,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-20 13:25:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:46,995 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:25:46,995 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:25:46,996 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:25:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:25:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-20 13:25:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-20 13:25:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-20 13:25:47,004 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-20 13:25:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:47,005 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-20 13:25:47,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-20 13:25:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-20 13:25:47,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:47,009 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:47,010 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-20 13:25:47,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:47,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:47,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:47,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:47,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:49,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:49,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-20 13:25:49,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:49,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-20 13:25:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-20 13:25:49,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-20 13:25:49,403 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-20 13:25:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:51,180 INFO L93 Difference]: Finished difference Result 293 states and 296 transitions. [2019-09-20 13:25:51,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-20 13:25:51,181 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-20 13:25:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:51,184 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:25:51,184 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 13:25:51,186 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:25:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 13:25:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-20 13:25:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-20 13:25:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-20 13:25:51,193 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-20 13:25:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:51,195 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-20 13:25:51,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-20 13:25:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-20 13:25:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:25:51,198 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:51,198 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:51,199 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-20 13:25:51,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:51,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:51,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:51,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:51,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:51,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:51,982 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-20 13:25:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:52,708 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2019-09-20 13:25:52,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:52,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-20 13:25:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:52,712 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:25:52,712 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:25:52,712 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:25:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:25:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-20 13:25:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 13:25:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-20 13:25:52,719 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-20 13:25:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:52,719 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-20 13:25:52,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-20 13:25:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-20 13:25:52,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:52,723 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:52,724 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-20 13:25:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:52,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:52,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:54,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:54,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-20 13:25:54,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:54,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-20 13:25:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-20 13:25:54,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:25:54,924 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 66 states. [2019-09-20 13:25:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:56,689 INFO L93 Difference]: Finished difference Result 296 states and 300 transitions. [2019-09-20 13:25:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 13:25:56,689 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-09-20 13:25:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:56,693 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:25:56,693 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:25:56,695 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-20 13:25:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:25:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 286. [2019-09-20 13:25:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-20 13:25:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-20 13:25:56,701 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-20 13:25:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:56,702 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-20 13:25:56,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-20 13:25:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-20 13:25:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-20 13:25:56,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:56,706 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:56,706 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:56,707 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-20 13:25:56,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:56,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:56,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:25:56,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:56,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:25:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:25:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:25:56,913 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-20 13:25:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:57,325 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2019-09-20 13:25:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:25:57,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-20 13:25:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:57,329 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:25:57,329 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:25:57,329 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:25:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-20 13:25:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-20 13:25:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-20 13:25:57,337 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-20 13:25:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:57,338 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-20 13:25:57,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:25:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-20 13:25:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 13:25:57,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:57,341 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:57,342 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-20 13:25:57,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:57,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:57,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:57,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:59,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:59,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-20 13:25:59,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:59,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-20 13:25:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-20 13:25:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:25:59,598 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-20 13:26:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:01,116 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2019-09-20 13:26:01,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 13:26:01,117 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-20 13:26:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:01,119 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:26:01,120 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:26:01,122 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-20 13:26:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:26:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-20 13:26:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-20 13:26:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-20 13:26:01,128 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-20 13:26:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:01,129 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-20 13:26:01,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-20 13:26:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-20 13:26:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 13:26:01,131 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:01,131 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:01,132 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-20 13:26:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:01,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:01,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:02,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:02,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-20 13:26:02,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:02,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-20 13:26:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-20 13:26:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-20 13:26:02,995 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-20 13:26:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:04,573 INFO L93 Difference]: Finished difference Result 296 states and 301 transitions. [2019-09-20 13:26:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-20 13:26:04,573 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-20 13:26:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:04,576 INFO L225 Difference]: With dead ends: 296 [2019-09-20 13:26:04,577 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 13:26:04,578 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:26:04,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 13:26:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-20 13:26:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-20 13:26:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-20 13:26:04,586 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-20 13:26:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:04,587 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-20 13:26:04,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-20 13:26:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-20 13:26:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-20 13:26:04,589 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:04,589 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:04,589 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:04,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-20 13:26:04,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:04,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:04,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:04,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:04,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:06,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-20 13:26:06,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:06,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-20 13:26:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-20 13:26:06,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-20 13:26:06,399 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand 65 states. [2019-09-20 13:26:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:07,948 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-09-20 13:26:07,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-20 13:26:07,949 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 258 [2019-09-20 13:26:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:07,952 INFO L225 Difference]: With dead ends: 299 [2019-09-20 13:26:07,952 INFO L226 Difference]: Without dead ends: 299 [2019-09-20 13:26:07,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 13:26:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-20 13:26:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 276. [2019-09-20 13:26:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-20 13:26:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2019-09-20 13:26:07,962 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2019-09-20 13:26:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:07,962 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2019-09-20 13:26:07,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-20 13:26:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2019-09-20 13:26:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-20 13:26:07,964 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:07,965 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:07,965 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -559520514, now seen corresponding path program 1 times [2019-09-20 13:26:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:07,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:07,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:07,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:07,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:08,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:08,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:08,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:08,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:08,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:08,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:08,808 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand 6 states.