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/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:04:20,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:04:20,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:04:20,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:04:20,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:04:20,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:04:20,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:04:20,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:04:20,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:04:20,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:04:20,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:04:20,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:04:20,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:04:20,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:04:20,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:04:20,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:04:20,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:04:20,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:04:20,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:04:20,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:04:20,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:04:20,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:04:20,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:04:20,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:04:20,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:04:20,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:04:20,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:04:20,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:04:20,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:04:20,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:04:20,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:04:20,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:04:20,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:04:20,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:04:20,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:04:20,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:04:20,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:04:20,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:04:20,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:04:20,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:04:20,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:04:20,808 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 04:04:20,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:04:20,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:04:20,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:04:20,846 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:04:20,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:04:20,847 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:04:20,847 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:04:20,847 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:04:20,848 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:04:20,848 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:04:20,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:04:20,852 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:04:20,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:04:20,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:04:20,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:04:20,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:04:20,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:04:20,854 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:04:20,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:04:20,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:04:20,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:04:20,855 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:04:20,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:04:20,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:04:20,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:04:20,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:04:20,856 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:04:20,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:04:20,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:04:20,857 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:04:20,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:04:20,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:04:20,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:04:20,933 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:04:20,934 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:04:20,935 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:21,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f24471/869bb6903bd94a9bb3e1b53239be566c/FLAG41b8b26fd [2019-09-10 04:04:21,606 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:04:21,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:21,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f24471/869bb6903bd94a9bb3e1b53239be566c/FLAG41b8b26fd [2019-09-10 04:04:21,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f24471/869bb6903bd94a9bb3e1b53239be566c [2019-09-10 04:04:21,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:04:21,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:04:21,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:21,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:04:21,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:04:21,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:21" (1/1) ... [2019-09-10 04:04:21,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2369f5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:21, skipping insertion in model container [2019-09-10 04:04:21,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:21" (1/1) ... [2019-09-10 04:04:21,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:04:21,918 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:04:22,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:22,548 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:04:22,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:22,780 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:04:22,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22 WrapperNode [2019-09-10 04:04:22,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:22,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:04:22,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:04:22,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:04:22,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (1/1) ... [2019-09-10 04:04:22,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:04:22,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:04:22,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:04:22,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:04:22,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (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 04:04:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:04:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:04:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:04:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:04:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:04:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:04:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:04:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:04:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:04:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:04:23,013 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:04:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:04:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:04:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:04:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:04:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:04:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:04:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:04:23,016 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:04:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:04:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:04:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:04:23,017 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:04:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:04:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:04:23,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:04:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:04:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:04:25,442 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:04:25,442 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:04:25,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:25 BoogieIcfgContainer [2019-09-10 04:04:25,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:04:25,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:04:25,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:04:25,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:04:25,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:04:21" (1/3) ... [2019-09-10 04:04:25,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4887e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:25, skipping insertion in model container [2019-09-10 04:04:25,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:22" (2/3) ... [2019-09-10 04:04:25,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4887e8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:25, skipping insertion in model container [2019-09-10 04:04:25,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:25" (3/3) ... [2019-09-10 04:04:25,452 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.1.ufo.BOUNDED-10.pals.c [2019-09-10 04:04:25,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:04:25,468 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:04:25,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:04:25,513 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:04:25,513 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:04:25,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:04:25,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:04:25,514 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:04:25,514 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:04:25,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:04:25,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:04:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states. [2019-09-10 04:04:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 04:04:25,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:25,585 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] [2019-09-10 04:04:25,587 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash -677110159, now seen corresponding path program 1 times [2019-09-10 04:04:25,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:25,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:25,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:26,283 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 04:04:26,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:26,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:26,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:26,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:26,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:26,311 INFO L87 Difference]: Start difference. First operand 712 states. Second operand 5 states. [2019-09-10 04:04:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:26,520 INFO L93 Difference]: Finished difference Result 716 states and 1289 transitions. [2019-09-10 04:04:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:26,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 04:04:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:26,563 INFO L225 Difference]: With dead ends: 716 [2019-09-10 04:04:26,563 INFO L226 Difference]: Without dead ends: 707 [2019-09-10 04:04:26,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-09-10 04:04:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-09-10 04:04:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-09-10 04:04:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1241 transitions. [2019-09-10 04:04:26,696 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1241 transitions. Word has length 176 [2019-09-10 04:04:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:26,699 INFO L475 AbstractCegarLoop]: Abstraction has 707 states and 1241 transitions. [2019-09-10 04:04:26,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1241 transitions. [2019-09-10 04:04:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-10 04:04:26,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:26,709 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] [2019-09-10 04:04:26,709 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -177921348, now seen corresponding path program 1 times [2019-09-10 04:04:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:26,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:26,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:27,070 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 04:04:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:27,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:27,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:27,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:27,078 INFO L87 Difference]: Start difference. First operand 707 states and 1241 transitions. Second operand 5 states. [2019-09-10 04:04:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:30,003 INFO L93 Difference]: Finished difference Result 881 states and 1517 transitions. [2019-09-10 04:04:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:30,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2019-09-10 04:04:30,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:30,014 INFO L225 Difference]: With dead ends: 881 [2019-09-10 04:04:30,016 INFO L226 Difference]: Without dead ends: 881 [2019-09-10 04:04:30,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-10 04:04:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 869. [2019-09-10 04:04:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-09-10 04:04:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1502 transitions. [2019-09-10 04:04:30,075 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1502 transitions. Word has length 215 [2019-09-10 04:04:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:30,076 INFO L475 AbstractCegarLoop]: Abstraction has 869 states and 1502 transitions. [2019-09-10 04:04:30,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1502 transitions. [2019-09-10 04:04:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 04:04:30,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:30,082 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] [2019-09-10 04:04:30,083 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:30,083 INFO L82 PathProgramCache]: Analyzing trace with hash 688854872, now seen corresponding path program 1 times [2019-09-10 04:04:30,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:30,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:30,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:30,305 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 04:04:30,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:30,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:30,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:30,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:30,308 INFO L87 Difference]: Start difference. First operand 869 states and 1502 transitions. Second operand 5 states. [2019-09-10 04:04:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:32,959 INFO L93 Difference]: Finished difference Result 1194 states and 2020 transitions. [2019-09-10 04:04:32,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:32,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-10 04:04:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:32,968 INFO L225 Difference]: With dead ends: 1194 [2019-09-10 04:04:32,968 INFO L226 Difference]: Without dead ends: 1194 [2019-09-10 04:04:32,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-10 04:04:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1186. [2019-09-10 04:04:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-09-10 04:04:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2013 transitions. [2019-09-10 04:04:33,014 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2013 transitions. Word has length 219 [2019-09-10 04:04:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:33,015 INFO L475 AbstractCegarLoop]: Abstraction has 1186 states and 2013 transitions. [2019-09-10 04:04:33,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:33,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2013 transitions. [2019-09-10 04:04:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-10 04:04:33,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:33,021 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] [2019-09-10 04:04:33,021 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 461083060, now seen corresponding path program 1 times [2019-09-10 04:04:33,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:33,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:33,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:04:33,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:33,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:33,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:33,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:33,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:33,253 INFO L87 Difference]: Start difference. First operand 1186 states and 2013 transitions. Second operand 5 states. [2019-09-10 04:04:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:35,998 INFO L93 Difference]: Finished difference Result 1816 states and 3010 transitions. [2019-09-10 04:04:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:35,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-09-10 04:04:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:36,011 INFO L225 Difference]: With dead ends: 1816 [2019-09-10 04:04:36,011 INFO L226 Difference]: Without dead ends: 1816 [2019-09-10 04:04:36,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:36,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-10 04:04:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1802. [2019-09-10 04:04:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2019-09-10 04:04:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2997 transitions. [2019-09-10 04:04:36,133 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2997 transitions. Word has length 223 [2019-09-10 04:04:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:36,134 INFO L475 AbstractCegarLoop]: Abstraction has 1802 states and 2997 transitions. [2019-09-10 04:04:36,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2997 transitions. [2019-09-10 04:04:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-10 04:04:36,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:36,141 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] [2019-09-10 04:04:36,141 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1802555600, now seen corresponding path program 1 times [2019-09-10 04:04:36,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:36,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:36,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:36,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:36,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:36,382 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 04:04:36,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:36,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:36,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:36,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:36,385 INFO L87 Difference]: Start difference. First operand 1802 states and 2997 transitions. Second operand 5 states. [2019-09-10 04:04:39,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:39,233 INFO L93 Difference]: Finished difference Result 3024 states and 4914 transitions. [2019-09-10 04:04:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:39,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2019-09-10 04:04:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:39,263 INFO L225 Difference]: With dead ends: 3024 [2019-09-10 04:04:39,264 INFO L226 Difference]: Without dead ends: 3024 [2019-09-10 04:04:39,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2019-09-10 04:04:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 2998. [2019-09-10 04:04:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-09-10 04:04:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4889 transitions. [2019-09-10 04:04:39,408 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4889 transitions. Word has length 227 [2019-09-10 04:04:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:39,409 INFO L475 AbstractCegarLoop]: Abstraction has 2998 states and 4889 transitions. [2019-09-10 04:04:39,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4889 transitions. [2019-09-10 04:04:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-10 04:04:39,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:39,416 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] [2019-09-10 04:04:39,417 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1148513108, now seen corresponding path program 1 times [2019-09-10 04:04:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:39,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:39,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:39,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:39,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:39,596 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 04:04:39,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:39,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:39,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:39,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:39,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:39,598 INFO L87 Difference]: Start difference. First operand 2998 states and 4889 transitions. Second operand 5 states. [2019-09-10 04:04:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:42,322 INFO L93 Difference]: Finished difference Result 5368 states and 8570 transitions. [2019-09-10 04:04:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:04:42,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-10 04:04:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:42,352 INFO L225 Difference]: With dead ends: 5368 [2019-09-10 04:04:42,353 INFO L226 Difference]: Without dead ends: 5368 [2019-09-10 04:04:42,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:04:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2019-09-10 04:04:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5318. [2019-09-10 04:04:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5318 states. [2019-09-10 04:04:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 8521 transitions. [2019-09-10 04:04:42,523 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 8521 transitions. Word has length 231 [2019-09-10 04:04:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:42,524 INFO L475 AbstractCegarLoop]: Abstraction has 5318 states and 8521 transitions. [2019-09-10 04:04:42,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 8521 transitions. [2019-09-10 04:04:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 04:04:42,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:42,534 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] [2019-09-10 04:04:42,534 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:42,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1566868024, now seen corresponding path program 1 times [2019-09-10 04:04:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:42,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:42,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:43,085 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 04:04:43,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:43,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:04:43,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:43,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:04:43,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:04:43,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:04:43,088 INFO L87 Difference]: Start difference. First operand 5318 states and 8521 transitions. Second operand 13 states. [2019-09-10 04:04:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:55,318 INFO L93 Difference]: Finished difference Result 32685 states and 52910 transitions. [2019-09-10 04:04:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:04:55,320 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-10 04:04:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:55,498 INFO L225 Difference]: With dead ends: 32685 [2019-09-10 04:04:55,498 INFO L226 Difference]: Without dead ends: 32685 [2019-09-10 04:04:55,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:04:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32685 states. [2019-09-10 04:04:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32685 to 29375. [2019-09-10 04:04:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29375 states. [2019-09-10 04:04:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29375 states to 29375 states and 47403 transitions. [2019-09-10 04:04:57,049 INFO L78 Accepts]: Start accepts. Automaton has 29375 states and 47403 transitions. Word has length 235 [2019-09-10 04:04:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:57,049 INFO L475 AbstractCegarLoop]: Abstraction has 29375 states and 47403 transitions. [2019-09-10 04:04:57,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:04:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29375 states and 47403 transitions. [2019-09-10 04:04:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:04:57,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:57,075 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] [2019-09-10 04:04:57,075 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2057405150, now seen corresponding path program 1 times [2019-09-10 04:04:57,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:57,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:57,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:57,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:57,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:04:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:57,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:04:57,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:57,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:04:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:04:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:04:57,343 INFO L87 Difference]: Start difference. First operand 29375 states and 47403 transitions. Second operand 6 states. [2019-09-10 04:05:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:01,952 INFO L93 Difference]: Finished difference Result 46055 states and 74337 transitions. [2019-09-10 04:05:01,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:05:01,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-10 04:05:01,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:02,134 INFO L225 Difference]: With dead ends: 46055 [2019-09-10 04:05:02,134 INFO L226 Difference]: Without dead ends: 46055 [2019-09-10 04:05:02,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:05:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2019-09-10 04:05:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 43349. [2019-09-10 04:05:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43349 states. [2019-09-10 04:05:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43349 states to 43349 states and 70066 transitions. [2019-09-10 04:05:03,191 INFO L78 Accepts]: Start accepts. Automaton has 43349 states and 70066 transitions. Word has length 236 [2019-09-10 04:05:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:03,191 INFO L475 AbstractCegarLoop]: Abstraction has 43349 states and 70066 transitions. [2019-09-10 04:05:03,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 43349 states and 70066 transitions. [2019-09-10 04:05:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:05:03,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:03,219 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] [2019-09-10 04:05:03,219 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1825607803, now seen corresponding path program 1 times [2019-09-10 04:05:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:03,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:03,610 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 04:05:03,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:03,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:03,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:03,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:03,613 INFO L87 Difference]: Start difference. First operand 43349 states and 70066 transitions. Second operand 13 states. [2019-09-10 04:05:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:19,191 INFO L93 Difference]: Finished difference Result 78528 states and 127723 transitions. [2019-09-10 04:05:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:05:19,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 236 [2019-09-10 04:05:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:19,506 INFO L225 Difference]: With dead ends: 78528 [2019-09-10 04:05:19,506 INFO L226 Difference]: Without dead ends: 78528 [2019-09-10 04:05:19,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2094 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:05:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78528 states. [2019-09-10 04:05:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78528 to 74830. [2019-09-10 04:05:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74830 states. [2019-09-10 04:05:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74830 states to 74830 states and 121277 transitions. [2019-09-10 04:05:21,122 INFO L78 Accepts]: Start accepts. Automaton has 74830 states and 121277 transitions. Word has length 236 [2019-09-10 04:05:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:21,123 INFO L475 AbstractCegarLoop]: Abstraction has 74830 states and 121277 transitions. [2019-09-10 04:05:21,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:05:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 74830 states and 121277 transitions. [2019-09-10 04:05:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:05:21,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:21,158 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] [2019-09-10 04:05:21,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash 494699546, now seen corresponding path program 1 times [2019-09-10 04:05:21,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:21,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:21,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:21,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:21,552 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 04:05:21,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:21,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:21,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:21,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:21,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:21,559 INFO L87 Difference]: Start difference. First operand 74830 states and 121277 transitions. Second operand 13 states. [2019-09-10 04:05:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:39,432 INFO L93 Difference]: Finished difference Result 110135 states and 179724 transitions. [2019-09-10 04:05:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:05:39,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 236 [2019-09-10 04:05:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:40,024 INFO L225 Difference]: With dead ends: 110135 [2019-09-10 04:05:40,024 INFO L226 Difference]: Without dead ends: 110135 [2019-09-10 04:05:40,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1069, Invalid=4631, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:05:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110135 states. [2019-09-10 04:05:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110135 to 104483. [2019-09-10 04:05:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104483 states. [2019-09-10 04:05:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104483 states to 104483 states and 169611 transitions. [2019-09-10 04:05:42,045 INFO L78 Accepts]: Start accepts. Automaton has 104483 states and 169611 transitions. Word has length 236 [2019-09-10 04:05:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:42,045 INFO L475 AbstractCegarLoop]: Abstraction has 104483 states and 169611 transitions. [2019-09-10 04:05:42,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:05:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 104483 states and 169611 transitions. [2019-09-10 04:05:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:05:42,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:42,073 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] [2019-09-10 04:05:42,073 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 812965755, now seen corresponding path program 1 times [2019-09-10 04:05:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:42,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:42,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:42,313 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 04:05:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:42,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:42,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:42,315 INFO L87 Difference]: Start difference. First operand 104483 states and 169611 transitions. Second operand 6 states. [2019-09-10 04:05:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:45,202 INFO L93 Difference]: Finished difference Result 109861 states and 179593 transitions. [2019-09-10 04:05:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:05:45,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-10 04:05:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:45,707 INFO L225 Difference]: With dead ends: 109861 [2019-09-10 04:05:45,707 INFO L226 Difference]: Without dead ends: 109861 [2019-09-10 04:05:45,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:05:45,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109861 states. [2019-09-10 04:05:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109861 to 104741. [2019-09-10 04:05:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104741 states. [2019-09-10 04:05:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104741 states to 104741 states and 169619 transitions. [2019-09-10 04:05:49,702 INFO L78 Accepts]: Start accepts. Automaton has 104741 states and 169619 transitions. Word has length 236 [2019-09-10 04:05:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:49,703 INFO L475 AbstractCegarLoop]: Abstraction has 104741 states and 169619 transitions. [2019-09-10 04:05:49,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 104741 states and 169619 transitions. [2019-09-10 04:05:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:05:49,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:49,726 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] [2019-09-10 04:05:49,726 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:49,727 INFO L82 PathProgramCache]: Analyzing trace with hash -786297892, now seen corresponding path program 1 times [2019-09-10 04:05:49,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:49,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:49,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:49,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:50,008 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 04:05:50,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:50,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:50,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:50,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:50,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:50,011 INFO L87 Difference]: Start difference. First operand 104741 states and 169619 transitions. Second operand 13 states. [2019-09-10 04:06:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:07,981 INFO L93 Difference]: Finished difference Result 140717 states and 228661 transitions. [2019-09-10 04:06:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:06:07,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 236 [2019-09-10 04:06:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:08,469 INFO L225 Difference]: With dead ends: 140717 [2019-09-10 04:06:08,470 INFO L226 Difference]: Without dead ends: 140717 [2019-09-10 04:06:08,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:06:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140717 states. [2019-09-10 04:06:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140717 to 133775. [2019-09-10 04:06:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133775 states. [2019-09-10 04:06:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133775 states to 133775 states and 216989 transitions. [2019-09-10 04:06:10,869 INFO L78 Accepts]: Start accepts. Automaton has 133775 states and 216989 transitions. Word has length 236 [2019-09-10 04:06:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 133775 states and 216989 transitions. [2019-09-10 04:06:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 133775 states and 216989 transitions. [2019-09-10 04:06:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:06:10,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:10,894 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] [2019-09-10 04:06:10,895 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:10,895 INFO L82 PathProgramCache]: Analyzing trace with hash 246420153, now seen corresponding path program 1 times [2019-09-10 04:06:10,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:10,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:10,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:10,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:06:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:11,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:11,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:11,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:11,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:11,156 INFO L87 Difference]: Start difference. First operand 133775 states and 216989 transitions. Second operand 6 states. [2019-09-10 04:06:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:16,542 INFO L93 Difference]: Finished difference Result 142518 states and 231495 transitions. [2019-09-10 04:06:16,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:16,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-10 04:06:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:17,111 INFO L225 Difference]: With dead ends: 142518 [2019-09-10 04:06:17,111 INFO L226 Difference]: Without dead ends: 142518 [2019-09-10 04:06:17,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:06:17,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142518 states. [2019-09-10 04:06:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142518 to 134307. [2019-09-10 04:06:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134307 states. [2019-09-10 04:06:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134307 states to 134307 states and 217399 transitions. [2019-09-10 04:06:19,367 INFO L78 Accepts]: Start accepts. Automaton has 134307 states and 217399 transitions. Word has length 236 [2019-09-10 04:06:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:19,368 INFO L475 AbstractCegarLoop]: Abstraction has 134307 states and 217399 transitions. [2019-09-10 04:06:19,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 134307 states and 217399 transitions. [2019-09-10 04:06:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 04:06:19,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:19,376 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] [2019-09-10 04:06:19,376 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1605928385, now seen corresponding path program 1 times [2019-09-10 04:06:19,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:19,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:19,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:19,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:06:19,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:19,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:19,603 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:19,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:19,604 INFO L87 Difference]: Start difference. First operand 134307 states and 217399 transitions. Second operand 6 states. [2019-09-10 04:06:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:23,795 INFO L93 Difference]: Finished difference Result 229780 states and 372074 transitions. [2019-09-10 04:06:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:06:23,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 04:06:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:25,344 INFO L225 Difference]: With dead ends: 229780 [2019-09-10 04:06:25,344 INFO L226 Difference]: Without dead ends: 229780 [2019-09-10 04:06:25,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:06:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229780 states. [2019-09-10 04:06:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229780 to 228981. [2019-09-10 04:06:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228981 states. [2019-09-10 04:06:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228981 states to 228981 states and 370977 transitions. [2019-09-10 04:06:29,253 INFO L78 Accepts]: Start accepts. Automaton has 228981 states and 370977 transitions. Word has length 237 [2019-09-10 04:06:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:29,253 INFO L475 AbstractCegarLoop]: Abstraction has 228981 states and 370977 transitions. [2019-09-10 04:06:29,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 228981 states and 370977 transitions. [2019-09-10 04:06:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 04:06:29,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:29,265 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] [2019-09-10 04:06:29,265 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1309693033, now seen corresponding path program 1 times [2019-09-10 04:06:29,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:29,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:29,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:29,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:29,627 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 04:06:29,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:29,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:29,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:29,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:29,629 INFO L87 Difference]: Start difference. First operand 228981 states and 370977 transitions. Second operand 6 states. [2019-09-10 04:06:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:37,613 INFO L93 Difference]: Finished difference Result 253022 states and 422400 transitions. [2019-09-10 04:06:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:37,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 04:06:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:38,598 INFO L225 Difference]: With dead ends: 253022 [2019-09-10 04:06:38,598 INFO L226 Difference]: Without dead ends: 253022 [2019-09-10 04:06:38,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:06:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253022 states. [2019-09-10 04:06:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253022 to 232751. [2019-09-10 04:06:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232751 states. [2019-09-10 04:06:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232751 states to 232751 states and 377386 transitions. [2019-09-10 04:06:48,667 INFO L78 Accepts]: Start accepts. Automaton has 232751 states and 377386 transitions. Word has length 237 [2019-09-10 04:06:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:48,668 INFO L475 AbstractCegarLoop]: Abstraction has 232751 states and 377386 transitions. [2019-09-10 04:06:48,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:06:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 232751 states and 377386 transitions. [2019-09-10 04:06:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 04:06:48,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:48,674 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] [2019-09-10 04:06:48,674 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash 253478119, now seen corresponding path program 1 times [2019-09-10 04:06:48,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:48,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:48,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:48,952 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 04:06:48,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:48,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:06:48,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:48,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:06:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:06:48,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:06:48,956 INFO L87 Difference]: Start difference. First operand 232751 states and 377386 transitions. Second operand 6 states. [2019-09-10 04:06:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:57,017 INFO L93 Difference]: Finished difference Result 252421 states and 421239 transitions. [2019-09-10 04:06:57,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:06:57,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 04:06:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:57,788 INFO L225 Difference]: With dead ends: 252421 [2019-09-10 04:06:57,788 INFO L226 Difference]: Without dead ends: 252421 [2019-09-10 04:06:57,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:06:57,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252421 states. [2019-09-10 04:07:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252421 to 235139. [2019-09-10 04:07:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235139 states. [2019-09-10 04:07:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235139 states to 235139 states and 381194 transitions. [2019-09-10 04:07:01,916 INFO L78 Accepts]: Start accepts. Automaton has 235139 states and 381194 transitions. Word has length 237 [2019-09-10 04:07:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:01,916 INFO L475 AbstractCegarLoop]: Abstraction has 235139 states and 381194 transitions. [2019-09-10 04:07:01,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:07:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 235139 states and 381194 transitions. [2019-09-10 04:07:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 04:07:01,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:01,920 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] [2019-09-10 04:07:01,920 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash 743164085, now seen corresponding path program 1 times [2019-09-10 04:07:01,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:01,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:01,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:02,998 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 04:07:02,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:02,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:07:02,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:03,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:07:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:07:03,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:07:03,000 INFO L87 Difference]: Start difference. First operand 235139 states and 381194 transitions. Second operand 6 states. [2019-09-10 04:07:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:13,631 INFO L93 Difference]: Finished difference Result 516513 states and 838868 transitions. [2019-09-10 04:07:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:07:13,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-10 04:07:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:14,871 INFO L225 Difference]: With dead ends: 516513 [2019-09-10 04:07:14,872 INFO L226 Difference]: Without dead ends: 516513 [2019-09-10 04:07:14,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:07:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516513 states. [2019-09-10 04:07:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516513 to 424680. [2019-09-10 04:07:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424680 states. [2019-09-10 04:07:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424680 states to 424680 states and 689627 transitions. [2019-09-10 04:07:22,112 INFO L78 Accepts]: Start accepts. Automaton has 424680 states and 689627 transitions. Word has length 238 [2019-09-10 04:07:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:22,112 INFO L475 AbstractCegarLoop]: Abstraction has 424680 states and 689627 transitions. [2019-09-10 04:07:22,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:07:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 424680 states and 689627 transitions. [2019-09-10 04:07:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 04:07:22,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:22,118 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] [2019-09-10 04:07:22,118 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash 498901686, now seen corresponding path program 1 times [2019-09-10 04:07:22,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:22,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:22,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:22,362 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 04:07:22,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:22,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:07:22,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:22,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:07:22,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:07:22,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:07:22,364 INFO L87 Difference]: Start difference. First operand 424680 states and 689627 transitions. Second operand 6 states. [2019-09-10 04:07:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:35,479 INFO L93 Difference]: Finished difference Result 836801 states and 1357065 transitions. [2019-09-10 04:07:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:07:35,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-10 04:07:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:38,002 INFO L225 Difference]: With dead ends: 836801 [2019-09-10 04:07:38,002 INFO L226 Difference]: Without dead ends: 836801 [2019-09-10 04:07:38,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:07:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836801 states. [2019-09-10 04:07:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836801 to 834921. [2019-09-10 04:07:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834921 states. [2019-09-10 04:08:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834921 states to 834921 states and 1353317 transitions. [2019-09-10 04:08:09,507 INFO L78 Accepts]: Start accepts. Automaton has 834921 states and 1353317 transitions. Word has length 239 [2019-09-10 04:08:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:09,507 INFO L475 AbstractCegarLoop]: Abstraction has 834921 states and 1353317 transitions. [2019-09-10 04:08:09,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 834921 states and 1353317 transitions. [2019-09-10 04:08:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:08:09,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:09,511 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] [2019-09-10 04:08:09,511 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1465016972, now seen corresponding path program 1 times [2019-09-10 04:08:09,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:09,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:09,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:09,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:09,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:09,731 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 04:08:09,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:09,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:09,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:09,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:09,733 INFO L87 Difference]: Start difference. First operand 834921 states and 1353317 transitions. Second operand 6 states. [2019-09-10 04:08:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:31,163 INFO L93 Difference]: Finished difference Result 1468193 states and 2381732 transitions. [2019-09-10 04:08:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:08:31,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 04:08:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:45,993 INFO L225 Difference]: With dead ends: 1468193 [2019-09-10 04:08:45,993 INFO L226 Difference]: Without dead ends: 1468193 [2019-09-10 04:08:45,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:08:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468193 states. [2019-09-10 04:09:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468193 to 1462915. [2019-09-10 04:09:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462915 states.