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/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:00:45,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:00:45,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:00:45,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:00:45,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:00:45,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:00:45,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:00:45,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:00:45,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:00:45,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:00:45,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:00:45,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:00:45,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:00:45,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:00:45,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:00:45,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:00:45,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:00:45,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:00:45,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:00:45,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:00:45,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:00:45,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:00:45,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:00:45,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:00:45,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:00:45,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:00:45,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:00:45,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:00:45,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:00:45,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:00:45,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:00:45,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:00:45,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:00:45,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:00:45,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:00:45,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:00:45,683 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:00:45,683 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:00:45,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:00:45,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:00:45,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:00:45,685 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-10 09:00:45,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:00:45,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:00:45,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:00:45,708 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:00:45,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:00:45,709 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:00:45,709 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:00:45,709 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:00:45,710 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:00:45,710 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:00:45,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:00:45,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:00:45,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:00:45,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:00:45,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:00:45,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:00:45,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:00:45,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:00:45,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:00:45,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:00:45,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:00:45,714 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:00:45,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:00:45,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:00:45,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:00:45,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:00:45,715 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:00:45,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:00:45,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:00:45,716 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:00:45,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:00:45,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:00:45,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:00:45,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:00:45,795 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:00:45,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:00:45,871 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7b3d5b/9567abd6cb24413c961ab13a4b516c3b/FLAG9d8cf37aa [2019-09-10 09:00:46,571 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:00:46,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:00:46,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7b3d5b/9567abd6cb24413c961ab13a4b516c3b/FLAG9d8cf37aa [2019-09-10 09:00:46,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7b3d5b/9567abd6cb24413c961ab13a4b516c3b [2019-09-10 09:00:46,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:00:46,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:00:46,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:46,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:00:46,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:00:46,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:46" (1/1) ... [2019-09-10 09:00:46,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd2cce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:46, skipping insertion in model container [2019-09-10 09:00:46,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:00:46" (1/1) ... [2019-09-10 09:00:46,705 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:00:46,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:00:48,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:48,373 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:00:49,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:00:49,388 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:00:49,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49 WrapperNode [2019-09-10 09:00:49,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:00:49,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:00:49,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:00:49,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:00:49,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (1/1) ... [2019-09-10 09:00:49,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:00:49,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:00:49,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:00:49,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:00:49,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (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-10 09:00:49,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:00:49,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:00:49,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:00:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:00:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:00:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 09:00:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:00:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:00:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:00:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:00:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:00:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:00:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:00:49,710 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:00:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:00:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:00:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:00:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:00:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:00:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:00:52,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:00:52,877 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:00:52,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:52 BoogieIcfgContainer [2019-09-10 09:00:52,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:00:52,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:00:52,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:00:52,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:00:52,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:00:46" (1/3) ... [2019-09-10 09:00:52,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afae159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:52, skipping insertion in model container [2019-09-10 09:00:52,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:00:49" (2/3) ... [2019-09-10 09:00:52,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afae159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:00:52, skipping insertion in model container [2019-09-10 09:00:52,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:00:52" (3/3) ... [2019-09-10 09:00:52,893 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 09:00:52,903 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:00:52,921 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 09:00:52,938 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 09:00:52,971 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:00:52,971 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:00:52,972 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:00:52,972 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:00:52,972 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:00:52,972 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:00:52,973 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:00:52,973 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:00:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states. [2019-09-10 09:00:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:53,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:53,064 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:53,067 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1892590216, now seen corresponding path program 1 times [2019-09-10 09:00:53,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:53,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:53,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:53,977 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-10 09:00:53,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:53,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:53,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:53,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:54,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:54,005 INFO L87 Difference]: Start difference. First operand 1027 states. Second operand 3 states. [2019-09-10 09:00:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:54,352 INFO L93 Difference]: Finished difference Result 1503 states and 2655 transitions. [2019-09-10 09:00:54,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:54,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 09:00:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:54,395 INFO L225 Difference]: With dead ends: 1503 [2019-09-10 09:00:54,395 INFO L226 Difference]: Without dead ends: 1495 [2019-09-10 09:00:54,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2019-09-10 09:00:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2019-09-10 09:00:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2019-09-10 09:00:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2282 transitions. [2019-09-10 09:00:54,552 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2282 transitions. Word has length 327 [2019-09-10 09:00:54,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:54,557 INFO L475 AbstractCegarLoop]: Abstraction has 1493 states and 2282 transitions. [2019-09-10 09:00:54,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2282 transitions. [2019-09-10 09:00:54,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:54,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:54,570 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:54,570 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 254890306, now seen corresponding path program 1 times [2019-09-10 09:00:54,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:54,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:54,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:54,963 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-10 09:00:54,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:54,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:54,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:54,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:54,969 INFO L87 Difference]: Start difference. First operand 1493 states and 2282 transitions. Second operand 3 states. [2019-09-10 09:00:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:55,205 INFO L93 Difference]: Finished difference Result 2459 states and 3782 transitions. [2019-09-10 09:00:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:55,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 09:00:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:55,220 INFO L225 Difference]: With dead ends: 2459 [2019-09-10 09:00:55,220 INFO L226 Difference]: Without dead ends: 2459 [2019-09-10 09:00:55,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-09-10 09:00:55,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2457. [2019-09-10 09:00:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2457 states. [2019-09-10 09:00:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3781 transitions. [2019-09-10 09:00:55,278 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3781 transitions. Word has length 327 [2019-09-10 09:00:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:55,279 INFO L475 AbstractCegarLoop]: Abstraction has 2457 states and 3781 transitions. [2019-09-10 09:00:55,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:55,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3781 transitions. [2019-09-10 09:00:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 09:00:55,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:55,289 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:55,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -629035401, now seen corresponding path program 1 times [2019-09-10 09:00:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:55,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:56,122 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-10 09:00:56,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:56,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:00:56,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:56,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:00:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:00:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:00:56,125 INFO L87 Difference]: Start difference. First operand 2457 states and 3781 transitions. Second operand 4 states. [2019-09-10 09:00:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:56,305 INFO L93 Difference]: Finished difference Result 4817 states and 7364 transitions. [2019-09-10 09:00:56,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:00:56,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 09:00:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:56,328 INFO L225 Difference]: With dead ends: 4817 [2019-09-10 09:00:56,328 INFO L226 Difference]: Without dead ends: 4817 [2019-09-10 09:00:56,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10 09:00:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2019-09-10 09:00:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 4689. [2019-09-10 09:00:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4689 states. [2019-09-10 09:00:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7207 transitions. [2019-09-10 09:00:56,449 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7207 transitions. Word has length 327 [2019-09-10 09:00:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:56,449 INFO L475 AbstractCegarLoop]: Abstraction has 4689 states and 7207 transitions. [2019-09-10 09:00:56,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:00:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7207 transitions. [2019-09-10 09:00:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 09:00:56,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:56,462 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:56,462 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:56,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:56,463 INFO L82 PathProgramCache]: Analyzing trace with hash 488411244, now seen corresponding path program 1 times [2019-09-10 09:00:56,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:56,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:56,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:56,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:56,730 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-10 09:00:56,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:56,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:56,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:56,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:56,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:56,732 INFO L87 Difference]: Start difference. First operand 4689 states and 7207 transitions. Second operand 3 states. [2019-09-10 09:00:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:56,861 INFO L93 Difference]: Finished difference Result 9358 states and 14379 transitions. [2019-09-10 09:00:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:56,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 09:00:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:56,916 INFO L225 Difference]: With dead ends: 9358 [2019-09-10 09:00:56,916 INFO L226 Difference]: Without dead ends: 9358 [2019-09-10 09:00:56,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2019-09-10 09:00:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 4702. [2019-09-10 09:00:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4702 states. [2019-09-10 09:00:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4702 states to 4702 states and 7226 transitions. [2019-09-10 09:00:57,163 INFO L78 Accepts]: Start accepts. Automaton has 4702 states and 7226 transitions. Word has length 329 [2019-09-10 09:00:57,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:57,164 INFO L475 AbstractCegarLoop]: Abstraction has 4702 states and 7226 transitions. [2019-09-10 09:00:57,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4702 states and 7226 transitions. [2019-09-10 09:00:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 09:00:57,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:57,182 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:57,185 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:57,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1617017327, now seen corresponding path program 1 times [2019-09-10 09:00:57,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:57,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:57,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:57,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:57,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:57,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-09-10 09:00:57,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:57,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:57,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:57,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:57,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:57,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:57,518 INFO L87 Difference]: Start difference. First operand 4702 states and 7226 transitions. Second operand 3 states. [2019-09-10 09:00:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:57,668 INFO L93 Difference]: Finished difference Result 9216 states and 14073 transitions. [2019-09-10 09:00:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:57,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 09:00:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:57,745 INFO L225 Difference]: With dead ends: 9216 [2019-09-10 09:00:57,745 INFO L226 Difference]: Without dead ends: 9216 [2019-09-10 09:00:57,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-09-10 09:00:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9088. [2019-09-10 09:00:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2019-09-10 09:00:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 13916 transitions. [2019-09-10 09:00:58,114 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 13916 transitions. Word has length 329 [2019-09-10 09:00:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:58,115 INFO L475 AbstractCegarLoop]: Abstraction has 9088 states and 13916 transitions. [2019-09-10 09:00:58,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 13916 transitions. [2019-09-10 09:00:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 09:00:58,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:58,149 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:58,150 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1430036047, now seen corresponding path program 1 times [2019-09-10 09:00:58,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:58,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:58,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:58,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:58,359 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-10 09:00:58,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:58,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:58,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:58,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:58,361 INFO L87 Difference]: Start difference. First operand 9088 states and 13916 transitions. Second operand 3 states. [2019-09-10 09:00:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:58,490 INFO L93 Difference]: Finished difference Result 18123 states and 27737 transitions. [2019-09-10 09:00:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:58,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 09:00:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:58,532 INFO L225 Difference]: With dead ends: 18123 [2019-09-10 09:00:58,532 INFO L226 Difference]: Without dead ends: 18123 [2019-09-10 09:00:58,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18123 states. [2019-09-10 09:00:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18123 to 9106. [2019-09-10 09:00:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9106 states. [2019-09-10 09:00:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9106 states to 9106 states and 13937 transitions. [2019-09-10 09:00:58,793 INFO L78 Accepts]: Start accepts. Automaton has 9106 states and 13937 transitions. Word has length 330 [2019-09-10 09:00:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:58,794 INFO L475 AbstractCegarLoop]: Abstraction has 9106 states and 13937 transitions. [2019-09-10 09:00:58,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 9106 states and 13937 transitions. [2019-09-10 09:00:58,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 09:00:58,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:58,819 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:58,820 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1413058346, now seen corresponding path program 1 times [2019-09-10 09:00:58,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:58,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:58,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:00:59,274 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-10 09:00:59,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:00:59,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:00:59,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:00:59,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:00:59,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:00:59,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:59,276 INFO L87 Difference]: Start difference. First operand 9106 states and 13937 transitions. Second operand 3 states. [2019-09-10 09:00:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:00:59,447 INFO L93 Difference]: Finished difference Result 16827 states and 25552 transitions. [2019-09-10 09:00:59,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:00:59,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 09:00:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:00:59,482 INFO L225 Difference]: With dead ends: 16827 [2019-09-10 09:00:59,483 INFO L226 Difference]: Without dead ends: 16827 [2019-09-10 09:00:59,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:00:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16827 states. [2019-09-10 09:00:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16827 to 16699. [2019-09-10 09:00:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16699 states. [2019-09-10 09:00:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16699 states to 16699 states and 25395 transitions. [2019-09-10 09:00:59,774 INFO L78 Accepts]: Start accepts. Automaton has 16699 states and 25395 transitions. Word has length 331 [2019-09-10 09:00:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:00:59,775 INFO L475 AbstractCegarLoop]: Abstraction has 16699 states and 25395 transitions. [2019-09-10 09:00:59,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:00:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 16699 states and 25395 transitions. [2019-09-10 09:00:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 09:00:59,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:00:59,809 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:00:59,810 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:00:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:00:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1317111591, now seen corresponding path program 1 times [2019-09-10 09:00:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:00:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:00:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:00:59,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:00:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:00,135 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-10 09:01:00,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:00,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:00,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:00,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:00,137 INFO L87 Difference]: Start difference. First operand 16699 states and 25395 transitions. Second operand 4 states. [2019-09-10 09:01:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:00,350 INFO L93 Difference]: Finished difference Result 31963 states and 48497 transitions. [2019-09-10 09:01:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:00,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-10 09:01:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:00,414 INFO L225 Difference]: With dead ends: 31963 [2019-09-10 09:01:00,415 INFO L226 Difference]: Without dead ends: 31963 [2019-09-10 09:01:00,415 INFO L628 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-10 09:01:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31963 states. [2019-09-10 09:01:00,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31963 to 16934. [2019-09-10 09:01:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16934 states. [2019-09-10 09:01:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16934 states to 16934 states and 25783 transitions. [2019-09-10 09:01:00,785 INFO L78 Accepts]: Start accepts. Automaton has 16934 states and 25783 transitions. Word has length 331 [2019-09-10 09:01:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:00,785 INFO L475 AbstractCegarLoop]: Abstraction has 16934 states and 25783 transitions. [2019-09-10 09:01:00,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 16934 states and 25783 transitions. [2019-09-10 09:01:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 09:01:00,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:00,824 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:00,824 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:00,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1336108137, now seen corresponding path program 1 times [2019-09-10 09:01:00,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:00,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:00,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:01,012 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-10 09:01:01,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:01,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:01,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:01,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:01,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:01,014 INFO L87 Difference]: Start difference. First operand 16934 states and 25783 transitions. Second operand 3 states. [2019-09-10 09:01:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:01,169 INFO L93 Difference]: Finished difference Result 25884 states and 39719 transitions. [2019-09-10 09:01:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:01,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 09:01:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:01,225 INFO L225 Difference]: With dead ends: 25884 [2019-09-10 09:01:01,225 INFO L226 Difference]: Without dead ends: 25884 [2019-09-10 09:01:01,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25884 states. [2019-09-10 09:01:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25884 to 20792. [2019-09-10 09:01:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20792 states. [2019-09-10 09:01:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20792 states to 20792 states and 32130 transitions. [2019-09-10 09:01:02,484 INFO L78 Accepts]: Start accepts. Automaton has 20792 states and 32130 transitions. Word has length 333 [2019-09-10 09:01:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:02,485 INFO L475 AbstractCegarLoop]: Abstraction has 20792 states and 32130 transitions. [2019-09-10 09:01:02,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 20792 states and 32130 transitions. [2019-09-10 09:01:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 09:01:02,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:02,515 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:02,516 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash -593945102, now seen corresponding path program 1 times [2019-09-10 09:01:02,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:02,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:02,699 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-10 09:01:02,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:02,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:02,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:02,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:02,702 INFO L87 Difference]: Start difference. First operand 20792 states and 32130 transitions. Second operand 3 states. [2019-09-10 09:01:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:02,829 INFO L93 Difference]: Finished difference Result 40817 states and 62904 transitions. [2019-09-10 09:01:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:02,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 09:01:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:02,910 INFO L225 Difference]: With dead ends: 40817 [2019-09-10 09:01:02,910 INFO L226 Difference]: Without dead ends: 40817 [2019-09-10 09:01:02,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40817 states. [2019-09-10 09:01:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40817 to 20896. [2019-09-10 09:01:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20896 states. [2019-09-10 09:01:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20896 states to 20896 states and 32273 transitions. [2019-09-10 09:01:03,365 INFO L78 Accepts]: Start accepts. Automaton has 20896 states and 32273 transitions. Word has length 333 [2019-09-10 09:01:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:03,366 INFO L475 AbstractCegarLoop]: Abstraction has 20896 states and 32273 transitions. [2019-09-10 09:01:03,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20896 states and 32273 transitions. [2019-09-10 09:01:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 09:01:03,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:03,386 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:03,387 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1494978179, now seen corresponding path program 1 times [2019-09-10 09:01:03,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:03,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:03,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:03,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:03,660 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-10 09:01:03,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:03,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:03,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:03,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:03,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:03,664 INFO L87 Difference]: Start difference. First operand 20896 states and 32273 transitions. Second operand 3 states. [2019-09-10 09:01:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:03,783 INFO L93 Difference]: Finished difference Result 40942 states and 63050 transitions. [2019-09-10 09:01:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:03,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 09:01:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:03,900 INFO L225 Difference]: With dead ends: 40942 [2019-09-10 09:01:03,900 INFO L226 Difference]: Without dead ends: 40942 [2019-09-10 09:01:03,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40942 states. [2019-09-10 09:01:04,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40942 to 21021. [2019-09-10 09:01:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21021 states. [2019-09-10 09:01:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21021 states to 21021 states and 32419 transitions. [2019-09-10 09:01:04,376 INFO L78 Accepts]: Start accepts. Automaton has 21021 states and 32419 transitions. Word has length 334 [2019-09-10 09:01:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:04,376 INFO L475 AbstractCegarLoop]: Abstraction has 21021 states and 32419 transitions. [2019-09-10 09:01:04,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 21021 states and 32419 transitions. [2019-09-10 09:01:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 09:01:04,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:04,395 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:04,395 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:04,396 INFO L82 PathProgramCache]: Analyzing trace with hash -639845697, now seen corresponding path program 1 times [2019-09-10 09:01:04,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:04,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:04,642 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-10 09:01:04,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:04,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:04,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:04,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:04,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:04,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:04,644 INFO L87 Difference]: Start difference. First operand 21021 states and 32419 transitions. Second operand 3 states. [2019-09-10 09:01:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:04,811 INFO L93 Difference]: Finished difference Result 32452 states and 50451 transitions. [2019-09-10 09:01:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:04,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 09:01:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:04,905 INFO L225 Difference]: With dead ends: 32452 [2019-09-10 09:01:04,912 INFO L226 Difference]: Without dead ends: 32452 [2019-09-10 09:01:04,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-09-10 09:01:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 27917. [2019-09-10 09:01:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27917 states. [2019-09-10 09:01:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27917 states to 27917 states and 43749 transitions. [2019-09-10 09:01:05,379 INFO L78 Accepts]: Start accepts. Automaton has 27917 states and 43749 transitions. Word has length 335 [2019-09-10 09:01:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:05,380 INFO L475 AbstractCegarLoop]: Abstraction has 27917 states and 43749 transitions. [2019-09-10 09:01:05,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27917 states and 43749 transitions. [2019-09-10 09:01:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 09:01:05,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:05,400 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:05,401 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1059276511, now seen corresponding path program 1 times [2019-09-10 09:01:05,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:05,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:05,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:05,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:05,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:05,969 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-10 09:01:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:05,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:05,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:05,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:05,971 INFO L87 Difference]: Start difference. First operand 27917 states and 43749 transitions. Second operand 4 states. [2019-09-10 09:01:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:06,070 INFO L93 Difference]: Finished difference Result 26858 states and 42074 transitions. [2019-09-10 09:01:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:06,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-09-10 09:01:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:06,147 INFO L225 Difference]: With dead ends: 26858 [2019-09-10 09:01:06,147 INFO L226 Difference]: Without dead ends: 26061 [2019-09-10 09:01:06,148 INFO L628 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-10 09:01:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26061 states. [2019-09-10 09:01:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26061 to 26041. [2019-09-10 09:01:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26041 states. [2019-09-10 09:01:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26041 states to 26041 states and 40807 transitions. [2019-09-10 09:01:06,479 INFO L78 Accepts]: Start accepts. Automaton has 26041 states and 40807 transitions. Word has length 335 [2019-09-10 09:01:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:06,480 INFO L475 AbstractCegarLoop]: Abstraction has 26041 states and 40807 transitions. [2019-09-10 09:01:06,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26041 states and 40807 transitions. [2019-09-10 09:01:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:01:06,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:06,495 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:06,495 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1893973212, now seen corresponding path program 1 times [2019-09-10 09:01:06,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:06,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:06,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:06,761 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-10 09:01:06,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:06,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:06,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:06,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:06,763 INFO L87 Difference]: Start difference. First operand 26041 states and 40807 transitions. Second operand 3 states. [2019-09-10 09:01:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:07,149 INFO L93 Difference]: Finished difference Result 48811 states and 76646 transitions. [2019-09-10 09:01:07,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:07,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 09:01:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:07,375 INFO L225 Difference]: With dead ends: 48811 [2019-09-10 09:01:07,375 INFO L226 Difference]: Without dead ends: 48811 [2019-09-10 09:01:07,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48811 states. [2019-09-10 09:01:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48811 to 48755. [2019-09-10 09:01:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48755 states. [2019-09-10 09:01:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48755 states to 48755 states and 76591 transitions. [2019-09-10 09:01:07,843 INFO L78 Accepts]: Start accepts. Automaton has 48755 states and 76591 transitions. Word has length 336 [2019-09-10 09:01:07,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:07,844 INFO L475 AbstractCegarLoop]: Abstraction has 48755 states and 76591 transitions. [2019-09-10 09:01:07,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:07,844 INFO L276 IsEmpty]: Start isEmpty. Operand 48755 states and 76591 transitions. [2019-09-10 09:01:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:01:07,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:07,867 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:07,867 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1894311836, now seen corresponding path program 1 times [2019-09-10 09:01:07,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:07,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:07,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:07,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:08,226 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-10 09:01:08,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:08,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:01:08,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:08,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:01:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:01:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:01:08,230 INFO L87 Difference]: Start difference. First operand 48755 states and 76591 transitions. Second operand 9 states. [2019-09-10 09:01:15,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:15,286 INFO L93 Difference]: Finished difference Result 346851 states and 550174 transitions. [2019-09-10 09:01:15,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 09:01:15,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-10 09:01:15,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:15,970 INFO L225 Difference]: With dead ends: 346851 [2019-09-10 09:01:15,970 INFO L226 Difference]: Without dead ends: 346851 [2019-09-10 09:01:15,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 09:01:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346851 states. [2019-09-10 09:01:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346851 to 149025. [2019-09-10 09:01:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149025 states. [2019-09-10 09:01:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149025 states to 149025 states and 234492 transitions. [2019-09-10 09:01:21,935 INFO L78 Accepts]: Start accepts. Automaton has 149025 states and 234492 transitions. Word has length 336 [2019-09-10 09:01:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:21,935 INFO L475 AbstractCegarLoop]: Abstraction has 149025 states and 234492 transitions. [2019-09-10 09:01:21,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:01:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 149025 states and 234492 transitions. [2019-09-10 09:01:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:01:22,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:22,009 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:22,009 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:22,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1418806943, now seen corresponding path program 1 times [2019-09-10 09:01:22,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:22,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:22,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:22,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:22,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:22,551 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-10 09:01:22,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:22,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:01:22,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:22,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:01:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:01:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:01:22,553 INFO L87 Difference]: Start difference. First operand 149025 states and 234492 transitions. Second operand 9 states. [2019-09-10 09:01:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:26,959 INFO L93 Difference]: Finished difference Result 201073 states and 315014 transitions. [2019-09-10 09:01:26,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 09:01:26,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-09-10 09:01:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:27,257 INFO L225 Difference]: With dead ends: 201073 [2019-09-10 09:01:27,257 INFO L226 Difference]: Without dead ends: 201073 [2019-09-10 09:01:27,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-10 09:01:27,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201073 states. [2019-09-10 09:01:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201073 to 65846. [2019-09-10 09:01:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65846 states. [2019-09-10 09:01:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65846 states to 65846 states and 101389 transitions. [2019-09-10 09:01:29,097 INFO L78 Accepts]: Start accepts. Automaton has 65846 states and 101389 transitions. Word has length 336 [2019-09-10 09:01:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:29,098 INFO L475 AbstractCegarLoop]: Abstraction has 65846 states and 101389 transitions. [2019-09-10 09:01:29,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:01:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 65846 states and 101389 transitions. [2019-09-10 09:01:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 09:01:29,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:29,122 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:29,122 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:29,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1191835422, now seen corresponding path program 1 times [2019-09-10 09:01:29,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:29,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:29,690 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-10 09:01:29,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:29,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:01:29,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:29,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:01:29,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:01:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:01:29,692 INFO L87 Difference]: Start difference. First operand 65846 states and 101389 transitions. Second operand 4 states. [2019-09-10 09:01:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:30,143 INFO L93 Difference]: Finished difference Result 128537 states and 197022 transitions. [2019-09-10 09:01:30,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:01:30,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-09-10 09:01:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:30,284 INFO L225 Difference]: With dead ends: 128537 [2019-09-10 09:01:30,284 INFO L226 Difference]: Without dead ends: 128537 [2019-09-10 09:01:30,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10 09:01:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128537 states. [2019-09-10 09:01:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128537 to 128346. [2019-09-10 09:01:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128346 states. [2019-09-10 09:01:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128346 states to 128346 states and 196773 transitions. [2019-09-10 09:01:33,546 INFO L78 Accepts]: Start accepts. Automaton has 128346 states and 196773 transitions. Word has length 336 [2019-09-10 09:01:33,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:33,547 INFO L475 AbstractCegarLoop]: Abstraction has 128346 states and 196773 transitions. [2019-09-10 09:01:33,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:01:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 128346 states and 196773 transitions. [2019-09-10 09:01:33,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-10 09:01:33,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:33,593 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:33,594 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:33,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1214005887, now seen corresponding path program 1 times [2019-09-10 09:01:33,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:33,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:33,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:33,854 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-10 09:01:33,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:33,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:33,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:33,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:33,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:33,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:33,856 INFO L87 Difference]: Start difference. First operand 128346 states and 196773 transitions. Second operand 3 states. [2019-09-10 09:01:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:34,447 INFO L93 Difference]: Finished difference Result 250769 states and 383079 transitions. [2019-09-10 09:01:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:34,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-10 09:01:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:34,749 INFO L225 Difference]: With dead ends: 250769 [2019-09-10 09:01:34,749 INFO L226 Difference]: Without dead ends: 250769 [2019-09-10 09:01:34,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250769 states. [2019-09-10 09:01:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250769 to 250586. [2019-09-10 09:01:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250586 states. [2019-09-10 09:01:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250586 states to 250586 states and 382846 transitions. [2019-09-10 09:01:37,748 INFO L78 Accepts]: Start accepts. Automaton has 250586 states and 382846 transitions. Word has length 338 [2019-09-10 09:01:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:37,748 INFO L475 AbstractCegarLoop]: Abstraction has 250586 states and 382846 transitions. [2019-09-10 09:01:37,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 250586 states and 382846 transitions. [2019-09-10 09:01:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-10 09:01:37,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:37,841 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:37,841 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1178320272, now seen corresponding path program 1 times [2019-09-10 09:01:37,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:37,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:37,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:37,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:42,360 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-10 09:01:42,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:42,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:42,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:42,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:42,362 INFO L87 Difference]: Start difference. First operand 250586 states and 382846 transitions. Second operand 3 states. [2019-09-10 09:01:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:43,394 INFO L93 Difference]: Finished difference Result 418063 states and 641540 transitions. [2019-09-10 09:01:43,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:43,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2019-09-10 09:01:43,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:44,000 INFO L225 Difference]: With dead ends: 418063 [2019-09-10 09:01:44,000 INFO L226 Difference]: Without dead ends: 418063 [2019-09-10 09:01:44,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418063 states. [2019-09-10 09:01:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418063 to 372826. [2019-09-10 09:01:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372826 states. [2019-09-10 09:01:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372826 states to 372826 states and 575094 transitions. [2019-09-10 09:01:52,600 INFO L78 Accepts]: Start accepts. Automaton has 372826 states and 575094 transitions. Word has length 339 [2019-09-10 09:01:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:01:52,601 INFO L475 AbstractCegarLoop]: Abstraction has 372826 states and 575094 transitions. [2019-09-10 09:01:52,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:01:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 372826 states and 575094 transitions. [2019-09-10 09:01:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 09:01:52,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:01:52,710 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:52,711 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:01:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:01:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1095505820, now seen corresponding path program 1 times [2019-09-10 09:01:52,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:01:52,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:52,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:01:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:01:52,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:01:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:01:53,011 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-10 09:01:53,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:01:53,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:01:53,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:01:53,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:01:53,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:01:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:53,014 INFO L87 Difference]: Start difference. First operand 372826 states and 575094 transitions. Second operand 3 states. [2019-09-10 09:01:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:01:56,177 INFO L93 Difference]: Finished difference Result 690109 states and 1057720 transitions. [2019-09-10 09:01:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:01:56,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 09:01:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:01:57,199 INFO L225 Difference]: With dead ends: 690109 [2019-09-10 09:01:57,199 INFO L226 Difference]: Without dead ends: 690109 [2019-09-10 09:01:57,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:01:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690109 states. [2019-09-10 09:02:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690109 to 689934. [2019-09-10 09:02:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689934 states. [2019-09-10 09:02:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689934 states to 689934 states and 1057503 transitions. [2019-09-10 09:02:23,113 INFO L78 Accepts]: Start accepts. Automaton has 689934 states and 1057503 transitions. Word has length 340 [2019-09-10 09:02:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:23,114 INFO L475 AbstractCegarLoop]: Abstraction has 689934 states and 1057503 transitions. [2019-09-10 09:02:23,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:02:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 689934 states and 1057503 transitions. [2019-09-10 09:02:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 09:02:23,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:02:23,341 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:23,341 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:02:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:02:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash 496932409, now seen corresponding path program 1 times [2019-09-10 09:02:23,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:02:23,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:02:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:02:23,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:02:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:02:23,665 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-10 09:02:23,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:02:23,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:02:23,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:02:23,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:02:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:02:23,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:02:23,667 INFO L87 Difference]: Start difference. First operand 689934 states and 1057503 transitions. Second operand 4 states. [2019-09-10 09:02:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:02:37,552 INFO L93 Difference]: Finished difference Result 1237046 states and 1892763 transitions. [2019-09-10 09:02:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:02:37,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-09-10 09:02:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:02:39,320 INFO L225 Difference]: With dead ends: 1237046 [2019-09-10 09:02:39,321 INFO L226 Difference]: Without dead ends: 1237046 [2019-09-10 09:02:39,321 INFO L628 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-10 09:02:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237046 states. [2019-09-10 09:02:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237046 to 676947. [2019-09-10 09:02:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676947 states. [2019-09-10 09:02:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676947 states to 676947 states and 1037189 transitions. [2019-09-10 09:02:58,506 INFO L78 Accepts]: Start accepts. Automaton has 676947 states and 1037189 transitions. Word has length 340 [2019-09-10 09:02:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:02:58,506 INFO L475 AbstractCegarLoop]: Abstraction has 676947 states and 1037189 transitions. [2019-09-10 09:02:58,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:02:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 676947 states and 1037189 transitions. [2019-09-10 09:03:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-10 09:03:08,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:08,109 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:03:08,110 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 518077033, now seen corresponding path program 1 times [2019-09-10 09:03:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:08,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:08,258 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-10 09:03:08,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:08,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:08,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:08,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:08,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:08,260 INFO L87 Difference]: Start difference. First operand 676947 states and 1037189 transitions. Second operand 3 states. [2019-09-10 09:03:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:12,063 INFO L93 Difference]: Finished difference Result 1209547 states and 1851173 transitions. [2019-09-10 09:03:12,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:12,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2019-09-10 09:03:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:15,075 INFO L225 Difference]: With dead ends: 1209547 [2019-09-10 09:03:15,076 INFO L226 Difference]: Without dead ends: 1209547 [2019-09-10 09:03:15,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209547 states. [2019-09-10 09:03:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209547 to 677428. [2019-09-10 09:03:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677428 states. [2019-09-10 09:03:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677428 states to 677428 states and 1037787 transitions. [2019-09-10 09:03:37,314 INFO L78 Accepts]: Start accepts. Automaton has 677428 states and 1037787 transitions. Word has length 343 [2019-09-10 09:03:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:03:37,315 INFO L475 AbstractCegarLoop]: Abstraction has 677428 states and 1037787 transitions. [2019-09-10 09:03:37,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:03:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 677428 states and 1037787 transitions. [2019-09-10 09:03:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-10 09:03:37,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:03:37,503 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:03:37,504 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:03:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:03:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1674386588, now seen corresponding path program 1 times [2019-09-10 09:03:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:03:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:37,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:03:37,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:03:37,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:03:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:03:46,226 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-10 09:03:46,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:03:46,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:03:46,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:03:46,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:03:46,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:03:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:46,228 INFO L87 Difference]: Start difference. First operand 677428 states and 1037787 transitions. Second operand 3 states. [2019-09-10 09:03:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:03:50,454 INFO L93 Difference]: Finished difference Result 1207532 states and 1863587 transitions. [2019-09-10 09:03:50,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:03:50,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-09-10 09:03:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:03:53,324 INFO L225 Difference]: With dead ends: 1207532 [2019-09-10 09:03:53,324 INFO L226 Difference]: Without dead ends: 1207532 [2019-09-10 09:03:53,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:03:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207532 states. [2019-09-10 09:04:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207532 to 1066260. [2019-09-10 09:04:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066260 states. [2019-09-10 09:04:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066260 states to 1066260 states and 1663700 transitions. [2019-09-10 09:04:30,327 INFO L78 Accepts]: Start accepts. Automaton has 1066260 states and 1663700 transitions. Word has length 344 [2019-09-10 09:04:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:30,328 INFO L475 AbstractCegarLoop]: Abstraction has 1066260 states and 1663700 transitions. [2019-09-10 09:04:30,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1066260 states and 1663700 transitions. [2019-09-10 09:04:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-10 09:04:30,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:30,512 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:04:30,513 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1064513104, now seen corresponding path program 1 times [2019-09-10 09:04:30,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:30,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:30,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:30,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:30,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:33,175 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-10 09:04:33,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:33,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:33,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:33,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:33,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:33,180 INFO L87 Difference]: Start difference. First operand 1066260 states and 1663700 transitions. Second operand 4 states. [2019-09-10 09:04:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:37,353 INFO L93 Difference]: Finished difference Result 1009189 states and 1573106 transitions. [2019-09-10 09:04:37,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:37,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-09-10 09:04:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:38,745 INFO L225 Difference]: With dead ends: 1009189 [2019-09-10 09:04:38,745 INFO L226 Difference]: Without dead ends: 1005021 [2019-09-10 09:04:38,746 INFO L628 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-10 09:04:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005021 states. [2019-09-10 09:05:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005021 to 1004694. [2019-09-10 09:05:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004694 states. [2019-09-10 09:05:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004694 states to 1004694 states and 1566241 transitions. [2019-09-10 09:05:23,055 INFO L78 Accepts]: Start accepts. Automaton has 1004694 states and 1566241 transitions. Word has length 344 [2019-09-10 09:05:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:23,055 INFO L475 AbstractCegarLoop]: Abstraction has 1004694 states and 1566241 transitions. [2019-09-10 09:05:23,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:05:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1004694 states and 1566241 transitions. [2019-09-10 09:05:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-10 09:05:23,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:23,212 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:05:23,213 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1587210856, now seen corresponding path program 1 times [2019-09-10 09:05:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:23,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:23,370 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-10 09:05:23,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:23,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:23,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:23,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:23,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:23,372 INFO L87 Difference]: Start difference. First operand 1004694 states and 1566241 transitions. Second operand 3 states. [2019-09-10 09:05:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:44,256 INFO L93 Difference]: Finished difference Result 1982772 states and 3067939 transitions. [2019-09-10 09:05:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:44,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-09-10 09:05:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:48,582 INFO L225 Difference]: With dead ends: 1982772 [2019-09-10 09:05:48,582 INFO L226 Difference]: Without dead ends: 1982772 [2019-09-10 09:05:48,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982772 states.