java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.10.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:43:29,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:43:29,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:43:29,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:43:29,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:43:29,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:43:29,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:43:29,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:43:29,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:43:29,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:43:29,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:43:29,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:43:29,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:43:29,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:43:29,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:43:29,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:43:29,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:43:29,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:43:29,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:43:29,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:43:29,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:43:29,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:43:29,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:43:29,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:43:29,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:43:29,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:43:29,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:43:29,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:43:29,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:43:29,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:43:29,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:43:29,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:43:29,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:43:29,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:43:29,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:43:29,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:43:29,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:43:29,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:43:29,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:43:29,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:43:29,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:43:29,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:43:29,919 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:43:29,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:43:29,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:43:29,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:43:29,921 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:43:29,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:43:29,922 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:43:29,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:43:29,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:43:29,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:43:29,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:43:29,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:43:29,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:43:29,923 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:43:29,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:43:29,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:43:29,924 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:43:29,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:43:29,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:43:29,924 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:43:29,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:43:29,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:43:29,925 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:43:29,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:43:29,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:43:29,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:43:29,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:43:29,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:43:29,926 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:43:29,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:43:29,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:43:29,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:43:29,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:43:29,996 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:43:29,997 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.10.cil-1.c [2019-09-08 06:43:30,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c211d1b2/553fce5fd145443b9c41d14db16f62de/FLAG9c18bec6e [2019-09-08 06:43:30,567 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:43:30,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.10.cil-1.c [2019-09-08 06:43:30,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c211d1b2/553fce5fd145443b9c41d14db16f62de/FLAG9c18bec6e [2019-09-08 06:43:30,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c211d1b2/553fce5fd145443b9c41d14db16f62de [2019-09-08 06:43:30,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:43:30,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:43:30,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:43:30,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:43:30,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:43:30,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:43:30" (1/1) ... [2019-09-08 06:43:30,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d63bf4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:30, skipping insertion in model container [2019-09-08 06:43:30,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:43:30" (1/1) ... [2019-09-08 06:43:30,891 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:43:30,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:43:31,343 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:43:31,359 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:43:31,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:43:31,590 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:43:31,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31 WrapperNode [2019-09-08 06:43:31,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:43:31,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:43:31,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:43:31,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:43:31,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (1/1) ... [2019-09-08 06:43:31,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:43:31,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:43:31,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:43:31,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:43:31,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (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-08 06:43:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:43:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:43:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:43:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:43:31,759 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:43:31,759 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:43:31,759 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:43:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:43:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:43:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:43:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:43:31,761 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:43:31,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:43:31,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:43:31,763 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:43:31,763 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:43:31,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:43:31,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:43:31,765 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:43:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:43:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:43:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:43:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:43:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:43:31,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:43:31,768 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:43:31,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:43:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:43:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:43:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:43:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:43:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:43:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:43:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:43:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:43:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:43:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:43:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:43:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:43:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:43:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:43:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:43:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:43:31,775 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:43:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:43:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:43:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:43:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:43:31,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:43:31,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:43:33,055 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:43:33,056 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-08 06:43:33,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:43:33 BoogieIcfgContainer [2019-09-08 06:43:33,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:43:33,061 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:43:33,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:43:33,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:43:33,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:43:30" (1/3) ... [2019-09-08 06:43:33,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ffd7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:43:33, skipping insertion in model container [2019-09-08 06:43:33,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:43:31" (2/3) ... [2019-09-08 06:43:33,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ffd7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:43:33, skipping insertion in model container [2019-09-08 06:43:33,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:43:33" (3/3) ... [2019-09-08 06:43:33,071 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-1.c [2019-09-08 06:43:33,086 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:43:33,113 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:43:33,134 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:43:33,193 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:43:33,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:43:33,194 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:43:33,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:43:33,194 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:43:33,194 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:43:33,194 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:43:33,195 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:43:33,195 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:43:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-09-08 06:43:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:33,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:33,245 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] [2019-09-08 06:43:33,247 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -658751810, now seen corresponding path program 1 times [2019-09-08 06:43:33,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:33,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:33,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:33,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:33,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:33,793 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-08 06:43:33,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:33,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:33,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:33,825 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 4 states. [2019-09-08 06:43:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:34,309 INFO L93 Difference]: Finished difference Result 822 states and 1268 transitions. [2019-09-08 06:43:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:34,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-08 06:43:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:34,329 INFO L225 Difference]: With dead ends: 822 [2019-09-08 06:43:34,329 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 06:43:34,337 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-08 06:43:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 06:43:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-09-08 06:43:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 602 transitions. [2019-09-08 06:43:34,463 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 602 transitions. Word has length 204 [2019-09-08 06:43:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:34,465 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 602 transitions. [2019-09-08 06:43:34,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 602 transitions. [2019-09-08 06:43:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:34,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:34,471 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] [2019-09-08 06:43:34,472 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:34,472 INFO L82 PathProgramCache]: Analyzing trace with hash -650752836, now seen corresponding path program 1 times [2019-09-08 06:43:34,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:34,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:34,723 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-08 06:43:34,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:34,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:34,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:34,732 INFO L87 Difference]: Start difference. First operand 412 states and 602 transitions. Second operand 5 states. [2019-09-08 06:43:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:35,761 INFO L93 Difference]: Finished difference Result 858 states and 1282 transitions. [2019-09-08 06:43:35,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:35,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:35,770 INFO L225 Difference]: With dead ends: 858 [2019-09-08 06:43:35,770 INFO L226 Difference]: Without dead ends: 474 [2019-09-08 06:43:35,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-08 06:43:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 412. [2019-09-08 06:43:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 601 transitions. [2019-09-08 06:43:35,821 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 601 transitions. Word has length 204 [2019-09-08 06:43:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:35,823 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 601 transitions. [2019-09-08 06:43:35,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 601 transitions. [2019-09-08 06:43:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:35,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:35,831 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] [2019-09-08 06:43:35,832 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1481406470, now seen corresponding path program 1 times [2019-09-08 06:43:35,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:35,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:35,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:43:36,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:36,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:36,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:36,015 INFO L87 Difference]: Start difference. First operand 412 states and 601 transitions. Second operand 5 states. [2019-09-08 06:43:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:36,854 INFO L93 Difference]: Finished difference Result 858 states and 1281 transitions. [2019-09-08 06:43:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:36,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:36,858 INFO L225 Difference]: With dead ends: 858 [2019-09-08 06:43:36,859 INFO L226 Difference]: Without dead ends: 474 [2019-09-08 06:43:36,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-08 06:43:36,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 412. [2019-09-08 06:43:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 600 transitions. [2019-09-08 06:43:36,888 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 600 transitions. Word has length 204 [2019-09-08 06:43:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:36,888 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 600 transitions. [2019-09-08 06:43:36,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 600 transitions. [2019-09-08 06:43:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:36,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:36,892 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] [2019-09-08 06:43:36,892 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -954012420, now seen corresponding path program 1 times [2019-09-08 06:43:36,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:37,014 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-08 06:43:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:37,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:37,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:37,016 INFO L87 Difference]: Start difference. First operand 412 states and 600 transitions. Second operand 5 states. [2019-09-08 06:43:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:37,861 INFO L93 Difference]: Finished difference Result 856 states and 1275 transitions. [2019-09-08 06:43:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:37,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:37,865 INFO L225 Difference]: With dead ends: 856 [2019-09-08 06:43:37,866 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 06:43:37,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 06:43:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2019-09-08 06:43:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 599 transitions. [2019-09-08 06:43:37,902 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 599 transitions. Word has length 204 [2019-09-08 06:43:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:37,903 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 599 transitions. [2019-09-08 06:43:37,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 599 transitions. [2019-09-08 06:43:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:37,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:37,906 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] [2019-09-08 06:43:37,907 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1972494266, now seen corresponding path program 1 times [2019-09-08 06:43:37,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:37,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:38,049 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-08 06:43:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:38,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:38,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:38,053 INFO L87 Difference]: Start difference. First operand 412 states and 599 transitions. Second operand 5 states. [2019-09-08 06:43:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:38,900 INFO L93 Difference]: Finished difference Result 854 states and 1269 transitions. [2019-09-08 06:43:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:38,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:38,904 INFO L225 Difference]: With dead ends: 854 [2019-09-08 06:43:38,905 INFO L226 Difference]: Without dead ends: 470 [2019-09-08 06:43:38,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-08 06:43:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 412. [2019-09-08 06:43:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2019-09-08 06:43:38,935 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 204 [2019-09-08 06:43:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:38,936 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2019-09-08 06:43:38,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2019-09-08 06:43:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:38,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:38,939 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] [2019-09-08 06:43:38,940 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1673880260, now seen corresponding path program 1 times [2019-09-08 06:43:38,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:38,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:38,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:39,058 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-08 06:43:39,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:39,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:39,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:39,061 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand 5 states. [2019-09-08 06:43:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:39,858 INFO L93 Difference]: Finished difference Result 852 states and 1263 transitions. [2019-09-08 06:43:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:39,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:39,862 INFO L225 Difference]: With dead ends: 852 [2019-09-08 06:43:39,862 INFO L226 Difference]: Without dead ends: 468 [2019-09-08 06:43:39,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-08 06:43:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 412. [2019-09-08 06:43:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 597 transitions. [2019-09-08 06:43:39,891 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 597 transitions. Word has length 204 [2019-09-08 06:43:39,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:39,891 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 597 transitions. [2019-09-08 06:43:39,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 597 transitions. [2019-09-08 06:43:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:39,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:39,895 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] [2019-09-08 06:43:39,895 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1117988730, now seen corresponding path program 1 times [2019-09-08 06:43:39,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:39,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:43:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:40,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:40,015 INFO L87 Difference]: Start difference. First operand 412 states and 597 transitions. Second operand 5 states. [2019-09-08 06:43:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:40,925 INFO L93 Difference]: Finished difference Result 850 states and 1257 transitions. [2019-09-08 06:43:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:40,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:40,930 INFO L225 Difference]: With dead ends: 850 [2019-09-08 06:43:40,930 INFO L226 Difference]: Without dead ends: 466 [2019-09-08 06:43:40,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-08 06:43:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 412. [2019-09-08 06:43:40,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 596 transitions. [2019-09-08 06:43:40,972 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 596 transitions. Word has length 204 [2019-09-08 06:43:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:40,973 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 596 transitions. [2019-09-08 06:43:40,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 596 transitions. [2019-09-08 06:43:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:40,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:40,976 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] [2019-09-08 06:43:40,976 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:40,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1208049020, now seen corresponding path program 1 times [2019-09-08 06:43:40,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:40,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:40,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:40,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:41,124 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-08 06:43:41,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:41,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:41,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:41,126 INFO L87 Difference]: Start difference. First operand 412 states and 596 transitions. Second operand 5 states. [2019-09-08 06:43:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:42,032 INFO L93 Difference]: Finished difference Result 846 states and 1247 transitions. [2019-09-08 06:43:42,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:42,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:42,036 INFO L225 Difference]: With dead ends: 846 [2019-09-08 06:43:42,036 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 06:43:42,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 06:43:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2019-09-08 06:43:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 595 transitions. [2019-09-08 06:43:42,070 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 595 transitions. Word has length 204 [2019-09-08 06:43:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:42,071 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 595 transitions. [2019-09-08 06:43:42,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 595 transitions. [2019-09-08 06:43:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:42,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43: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] [2019-09-08 06:43:42,074 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -199676930, now seen corresponding path program 1 times [2019-09-08 06:43:42,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:42,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:42,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:42,186 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-08 06:43:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:42,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:42,188 INFO L87 Difference]: Start difference. First operand 412 states and 595 transitions. Second operand 5 states. [2019-09-08 06:43:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:43,075 INFO L93 Difference]: Finished difference Result 844 states and 1241 transitions. [2019-09-08 06:43:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:43,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:43,081 INFO L225 Difference]: With dead ends: 844 [2019-09-08 06:43:43,081 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 06:43:43,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 06:43:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 412. [2019-09-08 06:43:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 594 transitions. [2019-09-08 06:43:43,124 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 594 transitions. Word has length 204 [2019-09-08 06:43:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:43,125 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 594 transitions. [2019-09-08 06:43:43,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 594 transitions. [2019-09-08 06:43:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:43,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:43,128 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] [2019-09-08 06:43:43,129 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:43,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash 309101884, now seen corresponding path program 1 times [2019-09-08 06:43:43,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:43,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:43,291 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-08 06:43:43,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:43,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:43,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:43,294 INFO L87 Difference]: Start difference. First operand 412 states and 594 transitions. Second operand 5 states. [2019-09-08 06:43:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:44,411 INFO L93 Difference]: Finished difference Result 842 states and 1235 transitions. [2019-09-08 06:43:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:44,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:44,416 INFO L225 Difference]: With dead ends: 842 [2019-09-08 06:43:44,416 INFO L226 Difference]: Without dead ends: 458 [2019-09-08 06:43:44,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-08 06:43:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 412. [2019-09-08 06:43:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 593 transitions. [2019-09-08 06:43:44,466 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 593 transitions. Word has length 204 [2019-09-08 06:43:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:44,467 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 593 transitions. [2019-09-08 06:43:44,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 593 transitions. [2019-09-08 06:43:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:44,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:44,470 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] [2019-09-08 06:43:44,471 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:44,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1614148546, now seen corresponding path program 1 times [2019-09-08 06:43:44,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:44,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:44,622 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-08 06:43:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:44,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:44,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:44,625 INFO L87 Difference]: Start difference. First operand 412 states and 593 transitions. Second operand 5 states. [2019-09-08 06:43:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:45,552 INFO L93 Difference]: Finished difference Result 840 states and 1229 transitions. [2019-09-08 06:43:45,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:45,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:45,556 INFO L225 Difference]: With dead ends: 840 [2019-09-08 06:43:45,556 INFO L226 Difference]: Without dead ends: 456 [2019-09-08 06:43:45,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-08 06:43:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-09-08 06:43:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 592 transitions. [2019-09-08 06:43:45,590 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 592 transitions. Word has length 204 [2019-09-08 06:43:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:45,591 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 592 transitions. [2019-09-08 06:43:45,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 592 transitions. [2019-09-08 06:43:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:45,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:45,593 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:45,593 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:45,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 956210428, now seen corresponding path program 1 times [2019-09-08 06:43:45,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:45,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:45,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:45,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:45,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:45,695 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-08 06:43:45,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:45,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:45,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:45,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:45,698 INFO L87 Difference]: Start difference. First operand 412 states and 592 transitions. Second operand 5 states. [2019-09-08 06:43:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:46,558 INFO L93 Difference]: Finished difference Result 881 states and 1303 transitions. [2019-09-08 06:43:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:46,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:46,562 INFO L225 Difference]: With dead ends: 881 [2019-09-08 06:43:46,562 INFO L226 Difference]: Without dead ends: 497 [2019-09-08 06:43:46,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-08 06:43:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 412. [2019-09-08 06:43:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 591 transitions. [2019-09-08 06:43:46,600 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 591 transitions. Word has length 204 [2019-09-08 06:43:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:46,601 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 591 transitions. [2019-09-08 06:43:46,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 591 transitions. [2019-09-08 06:43:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:46,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:46,603 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] [2019-09-08 06:43:46,603 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1454767230, now seen corresponding path program 1 times [2019-09-08 06:43:46,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:46,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:46,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:46,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:46,720 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-08 06:43:46,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:46,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:46,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:46,723 INFO L87 Difference]: Start difference. First operand 412 states and 591 transitions. Second operand 5 states. [2019-09-08 06:43:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:47,482 INFO L93 Difference]: Finished difference Result 875 states and 1292 transitions. [2019-09-08 06:43:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:47,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:47,486 INFO L225 Difference]: With dead ends: 875 [2019-09-08 06:43:47,487 INFO L226 Difference]: Without dead ends: 491 [2019-09-08 06:43:47,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-08 06:43:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 412. [2019-09-08 06:43:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 590 transitions. [2019-09-08 06:43:47,532 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 590 transitions. Word has length 204 [2019-09-08 06:43:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:47,532 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 590 transitions. [2019-09-08 06:43:47,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 590 transitions. [2019-09-08 06:43:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:47,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:47,536 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] [2019-09-08 06:43:47,537 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2025039036, now seen corresponding path program 1 times [2019-09-08 06:43:47,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:47,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:47,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:47,675 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-08 06:43:47,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:47,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:47,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:47,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:47,678 INFO L87 Difference]: Start difference. First operand 412 states and 590 transitions. Second operand 5 states. [2019-09-08 06:43:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:48,620 INFO L93 Difference]: Finished difference Result 877 states and 1291 transitions. [2019-09-08 06:43:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:48,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:48,625 INFO L225 Difference]: With dead ends: 877 [2019-09-08 06:43:48,626 INFO L226 Difference]: Without dead ends: 493 [2019-09-08 06:43:48,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-08 06:43:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 412. [2019-09-08 06:43:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 589 transitions. [2019-09-08 06:43:48,676 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 589 transitions. Word has length 204 [2019-09-08 06:43:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:48,677 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 589 transitions. [2019-09-08 06:43:48,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 589 transitions. [2019-09-08 06:43:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:48,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:48,679 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] [2019-09-08 06:43:48,679 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash -866059074, now seen corresponding path program 1 times [2019-09-08 06:43:48,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:48,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:48,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:48,862 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-08 06:43:48,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:48,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:48,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:48,866 INFO L87 Difference]: Start difference. First operand 412 states and 589 transitions. Second operand 5 states. [2019-09-08 06:43:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:49,702 INFO L93 Difference]: Finished difference Result 873 states and 1281 transitions. [2019-09-08 06:43:49,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:49,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:49,708 INFO L225 Difference]: With dead ends: 873 [2019-09-08 06:43:49,708 INFO L226 Difference]: Without dead ends: 489 [2019-09-08 06:43:49,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:49,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-08 06:43:49,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 412. [2019-09-08 06:43:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 588 transitions. [2019-09-08 06:43:49,771 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 588 transitions. Word has length 204 [2019-09-08 06:43:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:49,772 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 588 transitions. [2019-09-08 06:43:49,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 588 transitions. [2019-09-08 06:43:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:49,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:49,776 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] [2019-09-08 06:43:49,776 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash -198677184, now seen corresponding path program 1 times [2019-09-08 06:43:49,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:49,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:49,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:50,003 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-08 06:43:50,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:50,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:50,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:50,008 INFO L87 Difference]: Start difference. First operand 412 states and 588 transitions. Second operand 5 states. [2019-09-08 06:43:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:50,838 INFO L93 Difference]: Finished difference Result 871 states and 1275 transitions. [2019-09-08 06:43:50,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:50,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:50,841 INFO L225 Difference]: With dead ends: 871 [2019-09-08 06:43:50,842 INFO L226 Difference]: Without dead ends: 487 [2019-09-08 06:43:50,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-09-08 06:43:50,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 412. [2019-09-08 06:43:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 587 transitions. [2019-09-08 06:43:50,879 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 587 transitions. Word has length 204 [2019-09-08 06:43:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:50,879 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 587 transitions. [2019-09-08 06:43:50,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 587 transitions. [2019-09-08 06:43:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:50,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:50,881 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] [2019-09-08 06:43:50,881 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1901061246, now seen corresponding path program 1 times [2019-09-08 06:43:50,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:50,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:50,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:50,990 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-08 06:43:50,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:50,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:50,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:50,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:50,992 INFO L87 Difference]: Start difference. First operand 412 states and 587 transitions. Second operand 5 states. [2019-09-08 06:43:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:51,804 INFO L93 Difference]: Finished difference Result 869 states and 1269 transitions. [2019-09-08 06:43:51,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:51,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:51,808 INFO L225 Difference]: With dead ends: 869 [2019-09-08 06:43:51,808 INFO L226 Difference]: Without dead ends: 485 [2019-09-08 06:43:51,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-08 06:43:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 412. [2019-09-08 06:43:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 586 transitions. [2019-09-08 06:43:51,850 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 586 transitions. Word has length 204 [2019-09-08 06:43:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:51,850 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 586 transitions. [2019-09-08 06:43:51,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 586 transitions. [2019-09-08 06:43:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:51,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:51,852 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] [2019-09-08 06:43:51,853 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:51,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2049077888, now seen corresponding path program 1 times [2019-09-08 06:43:51,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:51,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:51,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:51,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:51,976 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-08 06:43:51,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:51,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:51,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:51,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:51,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:51,978 INFO L87 Difference]: Start difference. First operand 412 states and 586 transitions. Second operand 5 states. [2019-09-08 06:43:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:52,773 INFO L93 Difference]: Finished difference Result 867 states and 1263 transitions. [2019-09-08 06:43:52,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:52,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:52,778 INFO L225 Difference]: With dead ends: 867 [2019-09-08 06:43:52,778 INFO L226 Difference]: Without dead ends: 483 [2019-09-08 06:43:52,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-08 06:43:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 412. [2019-09-08 06:43:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 585 transitions. [2019-09-08 06:43:52,819 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 585 transitions. Word has length 204 [2019-09-08 06:43:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:52,819 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 585 transitions. [2019-09-08 06:43:52,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:52,820 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 585 transitions. [2019-09-08 06:43:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:52,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:52,821 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] [2019-09-08 06:43:52,822 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:52,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1068123074, now seen corresponding path program 1 times [2019-09-08 06:43:52,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:52,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:52,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:52,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:52,912 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-08 06:43:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:52,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:52,914 INFO L87 Difference]: Start difference. First operand 412 states and 585 transitions. Second operand 5 states. [2019-09-08 06:43:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:53,858 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2019-09-08 06:43:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:53,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:53,862 INFO L225 Difference]: With dead ends: 865 [2019-09-08 06:43:53,862 INFO L226 Difference]: Without dead ends: 481 [2019-09-08 06:43:53,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-08 06:43:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 412. [2019-09-08 06:43:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 584 transitions. [2019-09-08 06:43:53,938 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 584 transitions. Word has length 204 [2019-09-08 06:43:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:53,938 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 584 transitions. [2019-09-08 06:43:53,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 584 transitions. [2019-09-08 06:43:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:53,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:53,940 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] [2019-09-08 06:43:53,940 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:53,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:53,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1457372608, now seen corresponding path program 1 times [2019-09-08 06:43:53,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:53,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:53,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:53,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:54,035 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-08 06:43:54,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:54,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:54,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:54,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:54,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:54,037 INFO L87 Difference]: Start difference. First operand 412 states and 584 transitions. Second operand 5 states. [2019-09-08 06:43:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:54,921 INFO L93 Difference]: Finished difference Result 863 states and 1251 transitions. [2019-09-08 06:43:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:54,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:54,926 INFO L225 Difference]: With dead ends: 863 [2019-09-08 06:43:54,926 INFO L226 Difference]: Without dead ends: 479 [2019-09-08 06:43:54,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-08 06:43:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 412. [2019-09-08 06:43:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 583 transitions. [2019-09-08 06:43:55,003 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 583 transitions. Word has length 204 [2019-09-08 06:43:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:55,006 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 583 transitions. [2019-09-08 06:43:55,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 583 transitions. [2019-09-08 06:43:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:55,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:55,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:55,010 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:55,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 846103550, now seen corresponding path program 1 times [2019-09-08 06:43:55,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:55,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:55,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:55,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:55,161 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-08 06:43:55,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:55,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:55,163 INFO L87 Difference]: Start difference. First operand 412 states and 583 transitions. Second operand 5 states. [2019-09-08 06:43:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:56,275 INFO L93 Difference]: Finished difference Result 861 states and 1245 transitions. [2019-09-08 06:43:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:56,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 06:43:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:56,281 INFO L225 Difference]: With dead ends: 861 [2019-09-08 06:43:56,282 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 06:43:56,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-08 06:43:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 06:43:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 412. [2019-09-08 06:43:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-08 06:43:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 582 transitions. [2019-09-08 06:43:56,381 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 582 transitions. Word has length 204 [2019-09-08 06:43:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:56,383 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 582 transitions. [2019-09-08 06:43:56,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 582 transitions. [2019-09-08 06:43:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 06:43:56,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:56,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:56,387 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash -559088128, now seen corresponding path program 1 times [2019-09-08 06:43:56,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:56,553 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-08 06:43:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:56,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:56,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:56,555 INFO L87 Difference]: Start difference. First operand 412 states and 582 transitions. Second operand 4 states. [2019-09-08 06:43:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:57,182 INFO L93 Difference]: Finished difference Result 1164 states and 1698 transitions. [2019-09-08 06:43:57,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:57,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2019-09-08 06:43:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:57,193 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 06:43:57,194 INFO L226 Difference]: Without dead ends: 781 [2019-09-08 06:43:57,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-08 06:43:57,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-09-08 06:43:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 780. [2019-09-08 06:43:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-09-08 06:43:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1097 transitions. [2019-09-08 06:43:57,348 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1097 transitions. Word has length 204 [2019-09-08 06:43:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:57,349 INFO L475 AbstractCegarLoop]: Abstraction has 780 states and 1097 transitions. [2019-09-08 06:43:57,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1097 transitions. [2019-09-08 06:43:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 06:43:57,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:57,366 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:43:57,366 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -47931258, now seen corresponding path program 1 times [2019-09-08 06:43:57,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 06:43:57,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:43:57,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:43:57,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:58,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:43:58,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:43:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:43:58,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:43:58,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:43:58,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:43:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:43:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:58,485 INFO L87 Difference]: Start difference. First operand 780 states and 1097 transitions. Second operand 7 states. [2019-09-08 06:43:59,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:59,036 INFO L93 Difference]: Finished difference Result 2335 states and 3468 transitions. [2019-09-08 06:43:59,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:43:59,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 339 [2019-09-08 06:43:59,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:59,053 INFO L225 Difference]: With dead ends: 2335 [2019-09-08 06:43:59,053 INFO L226 Difference]: Without dead ends: 1584 [2019-09-08 06:43:59,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:43:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-09-08 06:43:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1510. [2019-09-08 06:43:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-09-08 06:43:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2173 transitions. [2019-09-08 06:43:59,275 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2173 transitions. Word has length 339 [2019-09-08 06:43:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:59,275 INFO L475 AbstractCegarLoop]: Abstraction has 1510 states and 2173 transitions. [2019-09-08 06:43:59,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:43:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2173 transitions. [2019-09-08 06:43:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 06:43:59,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:59,284 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:43:59,284 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1049634620, now seen corresponding path program 1 times [2019-09-08 06:43:59,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:59,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:59,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 06:43:59,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:59,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:59,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:59,423 INFO L87 Difference]: Start difference. First operand 1510 states and 2173 transitions. Second operand 4 states. [2019-09-08 06:43:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:59,807 INFO L93 Difference]: Finished difference Result 2977 states and 4278 transitions. [2019-09-08 06:43:59,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:59,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2019-09-08 06:43:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:59,814 INFO L225 Difference]: With dead ends: 2977 [2019-09-08 06:43:59,815 INFO L226 Difference]: Without dead ends: 1496 [2019-09-08 06:43:59,819 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-08 06:43:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-09-08 06:44:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2019-09-08 06:44:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-09-08 06:44:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2146 transitions. [2019-09-08 06:44:00,012 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2146 transitions. Word has length 339 [2019-09-08 06:44:00,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:00,012 INFO L475 AbstractCegarLoop]: Abstraction has 1496 states and 2146 transitions. [2019-09-08 06:44:00,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:44:00,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2146 transitions. [2019-09-08 06:44:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 06:44:00,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:00,017 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:00,018 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -959877755, now seen corresponding path program 1 times [2019-09-08 06:44:00,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:00,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 06:44:00,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:00,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:00,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:00,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 2176 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:00,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:44:00,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:00,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:44:00,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:44:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:44:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:00,571 INFO L87 Difference]: Start difference. First operand 1496 states and 2146 transitions. Second operand 7 states. [2019-09-08 06:44:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:01,107 INFO L93 Difference]: Finished difference Result 4550 states and 6935 transitions. [2019-09-08 06:44:01,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:44:01,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 340 [2019-09-08 06:44:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:01,124 INFO L225 Difference]: With dead ends: 4550 [2019-09-08 06:44:01,125 INFO L226 Difference]: Without dead ends: 3083 [2019-09-08 06:44:01,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:44:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2019-09-08 06:44:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3067. [2019-09-08 06:44:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-09-08 06:44:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4583 transitions. [2019-09-08 06:44:01,521 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4583 transitions. Word has length 340 [2019-09-08 06:44:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:01,521 INFO L475 AbstractCegarLoop]: Abstraction has 3067 states and 4583 transitions. [2019-09-08 06:44:01,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:44:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4583 transitions. [2019-09-08 06:44:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-08 06:44:01,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:01,531 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:01,531 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1021311995, now seen corresponding path program 1 times [2019-09-08 06:44:01,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 06:44:01,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:01,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:01,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:01,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 2288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:01,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 06:44:02,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:02,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:44:02,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:44:02,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:44:02,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:02,056 INFO L87 Difference]: Start difference. First operand 3067 states and 4583 transitions. Second operand 7 states. [2019-09-08 06:44:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:02,846 INFO L93 Difference]: Finished difference Result 9424 states and 15138 transitions. [2019-09-08 06:44:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:44:02,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 368 [2019-09-08 06:44:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:02,891 INFO L225 Difference]: With dead ends: 9424 [2019-09-08 06:44:02,891 INFO L226 Difference]: Without dead ends: 6399 [2019-09-08 06:44:02,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:44:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2019-09-08 06:44:03,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6395. [2019-09-08 06:44:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2019-09-08 06:44:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 9867 transitions. [2019-09-08 06:44:04,026 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 9867 transitions. Word has length 368 [2019-09-08 06:44:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:04,026 INFO L475 AbstractCegarLoop]: Abstraction has 6395 states and 9867 transitions. [2019-09-08 06:44:04,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:44:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 9867 transitions. [2019-09-08 06:44:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 06:44:04,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:04,053 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:04,053 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 35316963, now seen corresponding path program 1 times [2019-09-08 06:44:04,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:04,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:04,211 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 06:44:04,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:04,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:04,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:04,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 2293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:04,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 06:44:04,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:04,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:44:04,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:04,675 INFO L87 Difference]: Start difference. First operand 6395 states and 9867 transitions. Second operand 5 states. [2019-09-08 06:44:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:07,130 INFO L93 Difference]: Finished difference Result 25119 states and 44199 transitions. [2019-09-08 06:44:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:07,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 369 [2019-09-08 06:44:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:07,259 INFO L225 Difference]: With dead ends: 25119 [2019-09-08 06:44:07,259 INFO L226 Difference]: Without dead ends: 18791 [2019-09-08 06:44:07,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 373 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-08 06:44:07,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18791 states. [2019-09-08 06:44:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18791 to 18703. [2019-09-08 06:44:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18703 states. [2019-09-08 06:44:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18703 states to 18703 states and 30415 transitions. [2019-09-08 06:44:10,701 INFO L78 Accepts]: Start accepts. Automaton has 18703 states and 30415 transitions. Word has length 369 [2019-09-08 06:44:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:10,701 INFO L475 AbstractCegarLoop]: Abstraction has 18703 states and 30415 transitions. [2019-09-08 06:44:10,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18703 states and 30415 transitions. [2019-09-08 06:44:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 06:44:10,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:10,740 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:10,740 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:10,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:10,740 INFO L82 PathProgramCache]: Analyzing trace with hash -772479597, now seen corresponding path program 1 times [2019-09-08 06:44:10,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:10,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:10,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:10,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:10,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-08 06:44:10,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:10,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:10,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:10,875 INFO L87 Difference]: Start difference. First operand 18703 states and 30415 transitions. Second operand 4 states. [2019-09-08 06:44:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:12,370 INFO L93 Difference]: Finished difference Result 34691 states and 55847 transitions. [2019-09-08 06:44:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:44:12,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 371 [2019-09-08 06:44:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:12,467 INFO L225 Difference]: With dead ends: 34691 [2019-09-08 06:44:12,467 INFO L226 Difference]: Without dead ends: 16031 [2019-09-08 06:44:12,548 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-08 06:44:12,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16031 states. [2019-09-08 06:44:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16031 to 16031. [2019-09-08 06:44:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16031 states. [2019-09-08 06:44:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16031 states to 16031 states and 25503 transitions. [2019-09-08 06:44:14,171 INFO L78 Accepts]: Start accepts. Automaton has 16031 states and 25503 transitions. Word has length 371 [2019-09-08 06:44:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:14,172 INFO L475 AbstractCegarLoop]: Abstraction has 16031 states and 25503 transitions. [2019-09-08 06:44:14,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:44:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 16031 states and 25503 transitions. [2019-09-08 06:44:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 06:44:14,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:14,218 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:14,218 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1174933420, now seen corresponding path program 1 times [2019-09-08 06:44:14,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:14,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:14,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:14,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 06:44:15,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:15,249 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:44:15,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:15,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 2298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:15,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:44:15,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:44:15,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:44:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:44:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:15,662 INFO L87 Difference]: Start difference. First operand 16031 states and 25503 transitions. Second operand 7 states. [2019-09-08 06:44:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:18,153 INFO L93 Difference]: Finished difference Result 48461 states and 87571 transitions. [2019-09-08 06:44:18,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:44:18,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 371 [2019-09-08 06:44:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:18,334 INFO L225 Difference]: With dead ends: 48461 [2019-09-08 06:44:18,334 INFO L226 Difference]: Without dead ends: 32471 [2019-09-08 06:44:18,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:44:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32471 states. [2019-09-08 06:44:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32471 to 32431. [2019-09-08 06:44:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32431 states. [2019-09-08 06:44:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32431 states to 32431 states and 54584 transitions. [2019-09-08 06:44:21,413 INFO L78 Accepts]: Start accepts. Automaton has 32431 states and 54584 transitions. Word has length 371 [2019-09-08 06:44:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:21,414 INFO L475 AbstractCegarLoop]: Abstraction has 32431 states and 54584 transitions. [2019-09-08 06:44:21,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:44:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32431 states and 54584 transitions. [2019-09-08 06:44:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 06:44:21,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:21,508 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:21,508 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1059229016, now seen corresponding path program 1 times [2019-09-08 06:44:21,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:21,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:21,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:21,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:21,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 06:44:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:21,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:21,890 INFO L87 Difference]: Start difference. First operand 32431 states and 54584 transitions. Second operand 4 states. [2019-09-08 06:44:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:24,390 INFO L93 Difference]: Finished difference Result 57184 states and 94940 transitions. [2019-09-08 06:44:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:44:24,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 341 [2019-09-08 06:44:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:24,515 INFO L225 Difference]: With dead ends: 57184 [2019-09-08 06:44:24,516 INFO L226 Difference]: Without dead ends: 24783 [2019-09-08 06:44:24,660 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-08 06:44:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24783 states. [2019-09-08 06:44:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24783 to 24783. [2019-09-08 06:44:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24783 states. [2019-09-08 06:44:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24783 states to 24783 states and 40402 transitions. [2019-09-08 06:44:28,465 INFO L78 Accepts]: Start accepts. Automaton has 24783 states and 40402 transitions. Word has length 341 [2019-09-08 06:44:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:28,465 INFO L475 AbstractCegarLoop]: Abstraction has 24783 states and 40402 transitions. [2019-09-08 06:44:28,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:44:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24783 states and 40402 transitions. [2019-09-08 06:44:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 06:44:28,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:28,495 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:28,495 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:28,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1331855386, now seen corresponding path program 1 times [2019-09-08 06:44:28,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:28,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:28,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 06:44:28,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:28,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:28,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 2178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:28,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 06:44:28,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:28,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:44:28,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:44:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:44:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:44:28,983 INFO L87 Difference]: Start difference. First operand 24783 states and 40402 transitions. Second operand 5 states. [2019-09-08 06:44:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:38,987 INFO L93 Difference]: Finished difference Result 122353 states and 249219 transitions. [2019-09-08 06:44:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:44:38,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 342 [2019-09-08 06:44:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:39,662 INFO L225 Difference]: With dead ends: 122353 [2019-09-08 06:44:39,662 INFO L226 Difference]: Without dead ends: 97599 [2019-09-08 06:44:40,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:44:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97599 states. [2019-09-08 06:44:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97599 to 97317. [2019-09-08 06:44:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97317 states. [2019-09-08 06:44:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97317 states to 97317 states and 178578 transitions. [2019-09-08 06:44:51,810 INFO L78 Accepts]: Start accepts. Automaton has 97317 states and 178578 transitions. Word has length 342 [2019-09-08 06:44:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:51,811 INFO L475 AbstractCegarLoop]: Abstraction has 97317 states and 178578 transitions. [2019-09-08 06:44:51,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:44:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 97317 states and 178578 transitions. [2019-09-08 06:44:51,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 06:44:51,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:51,934 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:44:51,935 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1065627652, now seen corresponding path program 1 times [2019-09-08 06:44:51,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:51,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:51,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:51,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:51,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 06:44:52,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:52,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:52,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:52,065 INFO L87 Difference]: Start difference. First operand 97317 states and 178578 transitions. Second operand 4 states. [2019-09-08 06:45:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:01,070 INFO L93 Difference]: Finished difference Result 170511 states and 308394 transitions. [2019-09-08 06:45:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:45:01,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 342 [2019-09-08 06:45:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:01,555 INFO L225 Difference]: With dead ends: 170511 [2019-09-08 06:45:01,555 INFO L226 Difference]: Without dead ends: 73223 [2019-09-08 06:45:02,000 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-08 06:45:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73223 states. [2019-09-08 06:45:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73223 to 73223. [2019-09-08 06:45:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73223 states. [2019-09-08 06:45:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73223 states to 73223 states and 129859 transitions. [2019-09-08 06:45:13,355 INFO L78 Accepts]: Start accepts. Automaton has 73223 states and 129859 transitions. Word has length 342 [2019-09-08 06:45:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:13,356 INFO L475 AbstractCegarLoop]: Abstraction has 73223 states and 129859 transitions. [2019-09-08 06:45:13,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:45:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 73223 states and 129859 transitions. [2019-09-08 06:45:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 06:45:13,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:13,474 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:45:13,474 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:13,475 INFO L82 PathProgramCache]: Analyzing trace with hash 160791556, now seen corresponding path program 1 times [2019-09-08 06:45:13,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:13,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:13,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:13,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 06:45:13,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:45:13,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:45:13,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:45:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:13,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 2179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:45:13,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:45:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:45:14,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:45:14,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:45:14,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:45:14,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:45:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:45:14,019 INFO L87 Difference]: Start difference. First operand 73223 states and 129859 transitions. Second operand 7 states. [2019-09-08 06:45:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:31,719 INFO L93 Difference]: Finished difference Result 228399 states and 500816 transitions. [2019-09-08 06:45:31,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:45:31,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-09-08 06:45:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:32,645 INFO L225 Difference]: With dead ends: 228399 [2019-09-08 06:45:32,645 INFO L226 Difference]: Without dead ends: 155205 [2019-09-08 06:45:33,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:45:33,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155205 states. [2019-09-08 06:45:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155205 to 154715. [2019-09-08 06:45:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154715 states. [2019-09-08 06:45:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154715 states to 154715 states and 316780 transitions. [2019-09-08 06:45:58,241 INFO L78 Accepts]: Start accepts. Automaton has 154715 states and 316780 transitions. Word has length 343 [2019-09-08 06:45:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:58,242 INFO L475 AbstractCegarLoop]: Abstraction has 154715 states and 316780 transitions. [2019-09-08 06:45:58,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:45:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 154715 states and 316780 transitions. [2019-09-08 06:45:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-08 06:45:58,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:58,502 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:45:58,502 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:58,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1081089553, now seen corresponding path program 1 times [2019-09-08 06:45:58,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:58,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:58,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:58,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-09-08 06:45:58,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:45:58,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:45:58,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:45:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:45:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:45:58,640 INFO L87 Difference]: Start difference. First operand 154715 states and 316780 transitions. Second operand 4 states. [2019-09-08 06:46:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:46:20,439 INFO L93 Difference]: Finished difference Result 309390 states and 633486 transitions. [2019-09-08 06:46:20,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:46:20,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 375 [2019-09-08 06:46:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:46:21,282 INFO L225 Difference]: With dead ends: 309390 [2019-09-08 06:46:21,283 INFO L226 Difference]: Without dead ends: 154704 [2019-09-08 06:46:23,176 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-08 06:46:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154704 states. [2019-09-08 06:46:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154704 to 154704. [2019-09-08 06:46:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154704 states. [2019-09-08 06:46:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154704 states to 154704 states and 316748 transitions. [2019-09-08 06:46:54,823 INFO L78 Accepts]: Start accepts. Automaton has 154704 states and 316748 transitions. Word has length 375 [2019-09-08 06:46:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:54,824 INFO L475 AbstractCegarLoop]: Abstraction has 154704 states and 316748 transitions. [2019-09-08 06:46:54,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:46:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 154704 states and 316748 transitions. [2019-09-08 06:46:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 06:46:55,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:55,027 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:46:55,027 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:55,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1373890041, now seen corresponding path program 1 times [2019-09-08 06:46:55,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:55,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:55,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:55,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:55,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 06:46:55,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:46:55,166 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:46:55,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:46:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:55,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:46:55,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:46:55,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:55,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:46:55,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:46:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:46:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:46:55,566 INFO L87 Difference]: Start difference. First operand 154704 states and 316748 transitions. Second operand 7 states. [2019-09-08 06:47:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:54,021 INFO L93 Difference]: Finished difference Result 496314 states and 1337607 transitions. [2019-09-08 06:47:54,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:47:54,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 344 [2019-09-08 06:47:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:58,549 INFO L225 Difference]: With dead ends: 496314 [2019-09-08 06:47:58,550 INFO L226 Difference]: Without dead ends: 341639 [2019-09-08 06:48:12,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:48:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341639 states. [2019-09-08 06:49:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341639 to 340663. [2019-09-08 06:49:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340663 states. [2019-09-08 06:49:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340663 states to 340663 states and 847409 transitions. [2019-09-08 06:49:38,740 INFO L78 Accepts]: Start accepts. Automaton has 340663 states and 847409 transitions. Word has length 344 [2019-09-08 06:49:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:38,741 INFO L475 AbstractCegarLoop]: Abstraction has 340663 states and 847409 transitions. [2019-09-08 06:49:38,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:49:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 340663 states and 847409 transitions. [2019-09-08 06:49:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 06:49:40,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:40,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:49:40,792 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:40,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1315918405, now seen corresponding path program 1 times [2019-09-08 06:49:40,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:40,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:40,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 06:49:40,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:40,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:40,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:40,906 INFO L87 Difference]: Start difference. First operand 340663 states and 847409 transitions. Second operand 4 states. [2019-09-08 06:50:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:55,172 INFO L93 Difference]: Finished difference Result 681287 states and 1694729 transitions. [2019-09-08 06:50:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:55,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-09-08 06:50:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:57,907 INFO L225 Difference]: With dead ends: 681287 [2019-09-08 06:50:57,907 INFO L226 Difference]: Without dead ends: 340653 [2019-09-08 06:51:18,530 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-08 06:51:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340653 states.