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_opt-floodmax.5.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 05:04:51,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 05:04:51,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 05:04:51,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 05:04:51,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 05:04:51,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 05:04:51,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 05:04:51,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 05:04:51,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 05:04:51,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 05:04:51,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 05:04:51,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 05:04:51,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 05:04:51,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 05:04:51,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 05:04:51,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 05:04:51,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 05:04:51,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 05:04:51,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 05:04:51,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 05:04:51,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 05:04:51,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 05:04:51,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 05:04:51,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 05:04:51,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 05:04:51,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 05:04:51,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 05:04:51,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 05:04:51,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 05:04:51,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 05:04:51,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 05:04:51,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 05:04:51,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 05:04:51,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 05:04:51,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 05:04:51,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 05:04:51,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 05:04:51,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 05:04:51,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 05:04:51,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 05:04:51,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 05:04:51,800 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 05:04:51,817 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 05:04:51,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 05:04:51,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 05:04:51,818 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 05:04:51,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 05:04:51,818 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 05:04:51,819 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 05:04:51,819 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 05:04:51,819 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 05:04:51,819 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 05:04:51,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 05:04:51,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 05:04:51,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 05:04:51,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 05:04:51,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 05:04:51,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 05:04:51,822 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 05:04:51,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 05:04:51,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 05:04:51,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 05:04:51,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 05:04:51,823 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 05:04:51,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 05:04:51,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 05:04:51,824 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 05:04:51,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 05:04:51,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 05:04:51,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 05:04:51,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 05:04:51,871 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 05:04:51,872 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:51,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8795fda/bac2ecce254d405bb513ce718b92a947/FLAG238f6b9cc [2019-09-10 05:04:52,604 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 05:04:52,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:52,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8795fda/bac2ecce254d405bb513ce718b92a947/FLAG238f6b9cc [2019-09-10 05:04:52,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8795fda/bac2ecce254d405bb513ce718b92a947 [2019-09-10 05:04:52,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 05:04:52,831 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 05:04:52,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 05:04:52,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 05:04:52,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 05:04:52,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:52" (1/1) ... [2019-09-10 05:04:52,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c2810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:52, skipping insertion in model container [2019-09-10 05:04:52,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 05:04:52" (1/1) ... [2019-09-10 05:04:52,846 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 05:04:52,919 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 05:04:53,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:04:53,501 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 05:04:53,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 05:04:53,692 INFO L192 MainTranslator]: Completed translation [2019-09-10 05:04:53,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53 WrapperNode [2019-09-10 05:04:53,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 05:04:53,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 05:04:53,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 05:04:53,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 05:04:53,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (1/1) ... [2019-09-10 05:04:53,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 05:04:53,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 05:04:53,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 05:04:53,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 05:04:53,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (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 05:04:53,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 05:04:53,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 05:04:53,970 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 05:04:53,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 05:04:53,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 05:04:53,971 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 05:04:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 05:04:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 05:04:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 05:04:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 05:04:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 05:04:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 05:04:53,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 05:04:53,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 05:04:53,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 05:04:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 05:04:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 05:04:53,976 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 05:04:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 05:04:53,977 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 05:04:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 05:04:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 05:04:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 05:04:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 05:04:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 05:04:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 05:04:53,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 05:04:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 05:04:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 05:04:56,611 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 05:04:56,612 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 05:04:56,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:56 BoogieIcfgContainer [2019-09-10 05:04:56,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 05:04:56,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 05:04:56,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 05:04:56,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 05:04:56,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 05:04:52" (1/3) ... [2019-09-10 05:04:56,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffda250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:56, skipping insertion in model container [2019-09-10 05:04:56,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 05:04:53" (2/3) ... [2019-09-10 05:04:56,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffda250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 05:04:56, skipping insertion in model container [2019-09-10 05:04:56,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 05:04:56" (3/3) ... [2019-09-10 05:04:56,626 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.ufo.UNBOUNDED.pals.c [2019-09-10 05:04:56,637 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 05:04:56,648 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 05:04:56,665 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 05:04:56,705 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 05:04:56,705 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 05:04:56,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 05:04:56,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 05:04:56,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 05:04:56,705 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 05:04:56,705 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 05:04:56,705 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 05:04:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states. [2019-09-10 05:04:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 05:04:56,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:56,783 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] [2019-09-10 05:04:56,785 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1090629948, now seen corresponding path program 1 times [2019-09-10 05:04:56,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:56,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:57,540 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 05:04:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:57,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:04:57,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:57,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:04:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:04:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:04:57,568 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 5 states. [2019-09-10 05:04:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:04:57,875 INFO L93 Difference]: Finished difference Result 775 states and 1398 transitions. [2019-09-10 05:04:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 05:04:57,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-09-10 05:04:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:04:57,914 INFO L225 Difference]: With dead ends: 775 [2019-09-10 05:04:57,914 INFO L226 Difference]: Without dead ends: 771 [2019-09-10 05:04:57,917 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 05:04:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-10 05:04:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2019-09-10 05:04:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-10 05:04:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1330 transitions. [2019-09-10 05:04:58,065 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1330 transitions. Word has length 181 [2019-09-10 05:04:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:04:58,066 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1330 transitions. [2019-09-10 05:04:58,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:04:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1330 transitions. [2019-09-10 05:04:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 05:04:58,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:04:58,079 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:04:58,080 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:04:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:04:58,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1965304482, now seen corresponding path program 1 times [2019-09-10 05:04:58,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:04:58,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:58,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:04:58,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:04:58,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:04:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:04:58,891 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 05:04:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:04:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:04:58,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:04:58,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:04:58,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:04:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:04:58,897 INFO L87 Difference]: Start difference. First operand 771 states and 1330 transitions. Second operand 13 states. [2019-09-10 05:05:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:15,590 INFO L93 Difference]: Finished difference Result 3368 states and 5629 transitions. [2019-09-10 05:05:15,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 05:05:15,591 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 245 [2019-09-10 05:05:15,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:15,613 INFO L225 Difference]: With dead ends: 3368 [2019-09-10 05:05:15,613 INFO L226 Difference]: Without dead ends: 3368 [2019-09-10 05:05:15,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 05:05:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3368 states. [2019-09-10 05:05:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3368 to 1845. [2019-09-10 05:05:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-10 05:05:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 3108 transitions. [2019-09-10 05:05:15,717 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 3108 transitions. Word has length 245 [2019-09-10 05:05:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:15,719 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 3108 transitions. [2019-09-10 05:05:15,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 05:05:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3108 transitions. [2019-09-10 05:05:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 05:05:15,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:15,727 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -274859823, now seen corresponding path program 1 times [2019-09-10 05:05:15,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:15,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:15,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:15,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:16,060 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 05:05:16,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:16,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:16,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:16,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:16,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:16,072 INFO L87 Difference]: Start difference. First operand 1845 states and 3108 transitions. Second operand 6 states. [2019-09-10 05:05:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:20,168 INFO L93 Difference]: Finished difference Result 3155 states and 5262 transitions. [2019-09-10 05:05:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 05:05:20,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-09-10 05:05:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:20,195 INFO L225 Difference]: With dead ends: 3155 [2019-09-10 05:05:20,196 INFO L226 Difference]: Without dead ends: 3155 [2019-09-10 05:05:20,196 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 05:05:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2019-09-10 05:05:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 2934. [2019-09-10 05:05:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-09-10 05:05:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 4901 transitions. [2019-09-10 05:05:20,361 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 4901 transitions. Word has length 246 [2019-09-10 05:05:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:20,362 INFO L475 AbstractCegarLoop]: Abstraction has 2934 states and 4901 transitions. [2019-09-10 05:05:20,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 4901 transitions. [2019-09-10 05:05:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 05:05:20,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:20,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:20,375 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:20,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1052161479, now seen corresponding path program 1 times [2019-09-10 05:05:20,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:20,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:20,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:20,948 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 05:05:20,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:20,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:20,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:20,951 INFO L87 Difference]: Start difference. First operand 2934 states and 4901 transitions. Second operand 6 states. [2019-09-10 05:05:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:24,367 INFO L93 Difference]: Finished difference Result 4695 states and 7775 transitions. [2019-09-10 05:05:24,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 05:05:24,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 247 [2019-09-10 05:05:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:24,392 INFO L225 Difference]: With dead ends: 4695 [2019-09-10 05:05:24,392 INFO L226 Difference]: Without dead ends: 4695 [2019-09-10 05:05:24,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-10 05:05:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2019-09-10 05:05:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 4672. [2019-09-10 05:05:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4672 states. [2019-09-10 05:05:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4672 states to 4672 states and 7747 transitions. [2019-09-10 05:05:24,513 INFO L78 Accepts]: Start accepts. Automaton has 4672 states and 7747 transitions. Word has length 247 [2019-09-10 05:05:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:24,514 INFO L475 AbstractCegarLoop]: Abstraction has 4672 states and 7747 transitions. [2019-09-10 05:05:24,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4672 states and 7747 transitions. [2019-09-10 05:05:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 05:05:24,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:24,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:24,522 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash 569606024, now seen corresponding path program 1 times [2019-09-10 05:05:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:24,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:24,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:24,792 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 05:05:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:24,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:24,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:24,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:24,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:24,795 INFO L87 Difference]: Start difference. First operand 4672 states and 7747 transitions. Second operand 6 states. [2019-09-10 05:05:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:29,972 INFO L93 Difference]: Finished difference Result 20901 states and 34362 transitions. [2019-09-10 05:05:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:29,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-10 05:05:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:30,064 INFO L225 Difference]: With dead ends: 20901 [2019-09-10 05:05:30,064 INFO L226 Difference]: Without dead ends: 20901 [2019-09-10 05:05:30,065 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 05:05:30,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2019-09-10 05:05:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 20855. [2019-09-10 05:05:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20855 states. [2019-09-10 05:05:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20855 states to 20855 states and 34282 transitions. [2019-09-10 05:05:30,583 INFO L78 Accepts]: Start accepts. Automaton has 20855 states and 34282 transitions. Word has length 248 [2019-09-10 05:05:30,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:30,584 INFO L475 AbstractCegarLoop]: Abstraction has 20855 states and 34282 transitions. [2019-09-10 05:05:30,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20855 states and 34282 transitions. [2019-09-10 05:05:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 05:05:30,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:30,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:30,594 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -746893872, now seen corresponding path program 1 times [2019-09-10 05:05:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:30,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:30,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:30,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:30,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:30,898 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 05:05:30,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:30,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:30,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:30,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:30,901 INFO L87 Difference]: Start difference. First operand 20855 states and 34282 transitions. Second operand 6 states. [2019-09-10 05:05:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:37,059 INFO L93 Difference]: Finished difference Result 101582 states and 166587 transitions. [2019-09-10 05:05:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:37,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-10 05:05:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:37,483 INFO L225 Difference]: With dead ends: 101582 [2019-09-10 05:05:37,484 INFO L226 Difference]: Without dead ends: 101582 [2019-09-10 05:05:37,489 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 05:05:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101582 states. [2019-09-10 05:05:39,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101582 to 101384. [2019-09-10 05:05:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101384 states. [2019-09-10 05:05:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101384 states to 101384 states and 166203 transitions. [2019-09-10 05:05:39,474 INFO L78 Accepts]: Start accepts. Automaton has 101384 states and 166203 transitions. Word has length 249 [2019-09-10 05:05:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:05:39,476 INFO L475 AbstractCegarLoop]: Abstraction has 101384 states and 166203 transitions. [2019-09-10 05:05:39,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:05:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 101384 states and 166203 transitions. [2019-09-10 05:05:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 05:05:39,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:05:39,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:05:39,490 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:05:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:05:39,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1339597375, now seen corresponding path program 1 times [2019-09-10 05:05:39,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:05:39,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:39,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:05:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:05:39,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:05:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:05:39,770 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 05:05:39,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:05:39,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 05:05:39,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:05:39,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 05:05:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 05:05:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 05:05:39,772 INFO L87 Difference]: Start difference. First operand 101384 states and 166203 transitions. Second operand 6 states. [2019-09-10 05:05:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:05:47,500 INFO L93 Difference]: Finished difference Result 447821 states and 733079 transitions. [2019-09-10 05:05:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:05:47,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 250 [2019-09-10 05:05:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:05:48,915 INFO L225 Difference]: With dead ends: 447821 [2019-09-10 05:05:48,915 INFO L226 Difference]: Without dead ends: 447821 [2019-09-10 05:05:48,916 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 05:05:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447821 states. [2019-09-10 05:06:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447821 to 446872. [2019-09-10 05:06:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446872 states. [2019-09-10 05:06:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446872 states to 446872 states and 731274 transitions. [2019-09-10 05:06:03,636 INFO L78 Accepts]: Start accepts. Automaton has 446872 states and 731274 transitions. Word has length 250 [2019-09-10 05:06:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:06:03,637 INFO L475 AbstractCegarLoop]: Abstraction has 446872 states and 731274 transitions. [2019-09-10 05:06:03,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 05:06:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 446872 states and 731274 transitions. [2019-09-10 05:06:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-10 05:06:03,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:06:03,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:06:03,650 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:06:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:06:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2033618999, now seen corresponding path program 1 times [2019-09-10 05:06:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:06:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:03,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:06:03,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:06:03,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:06:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:06:04,938 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 05:06:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:06:04,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 05:06:04,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:06:04,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 05:06:04,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 05:06:04,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:06:04,940 INFO L87 Difference]: Start difference. First operand 446872 states and 731274 transitions. Second operand 4 states. [2019-09-10 05:06:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:06:16,331 INFO L93 Difference]: Finished difference Result 1201383 states and 1961488 transitions. [2019-09-10 05:06:16,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 05:06:16,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-09-10 05:06:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:06:20,266 INFO L225 Difference]: With dead ends: 1201383 [2019-09-10 05:06:20,266 INFO L226 Difference]: Without dead ends: 1201383 [2019-09-10 05:06:20,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 05:06:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201383 states. [2019-09-10 05:07:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201383 to 1195156. [2019-09-10 05:07:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195156 states. [2019-09-10 05:07:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195156 states to 1195156 states and 1953204 transitions. [2019-09-10 05:07:30,546 INFO L78 Accepts]: Start accepts. Automaton has 1195156 states and 1953204 transitions. Word has length 252 [2019-09-10 05:07:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:07:30,547 INFO L475 AbstractCegarLoop]: Abstraction has 1195156 states and 1953204 transitions. [2019-09-10 05:07:30,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 05:07:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1195156 states and 1953204 transitions. [2019-09-10 05:07:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 05:07:30,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:07:30,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:07:30,558 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:07:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:07:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash 873683357, now seen corresponding path program 1 times [2019-09-10 05:07:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:07:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:07:30,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:07:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:07:30,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:07:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:07:30,987 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 05:07:30,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:07:30,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 05:07:30,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:07:30,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 05:07:30,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 05:07:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-10 05:07:30,990 INFO L87 Difference]: Start difference. First operand 1195156 states and 1953204 transitions. Second operand 13 states. [2019-09-10 05:08:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:08:20,997 INFO L93 Difference]: Finished difference Result 1819403 states and 2978387 transitions. [2019-09-10 05:08:20,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 05:08:20,997 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2019-09-10 05:08:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:08:27,652 INFO L225 Difference]: With dead ends: 1819403 [2019-09-10 05:08:27,653 INFO L226 Difference]: Without dead ends: 1819403 [2019-09-10 05:08:27,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1733 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=985, Invalid=3985, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 05:08:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819403 states.