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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/transmitter.05.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:55,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:55,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:55,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:55,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:55,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:55,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:55,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:55,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:55,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:55,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:55,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:55,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:55,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:55,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:55,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:55,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:55,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:55,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:55,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:55,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:55,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:55,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:55,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:55,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:55,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:55,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:55,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:55,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:55,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:55,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:55,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:55,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:55,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:55,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:55,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:55,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:55,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:55,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:55,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:55,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:55,105 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-10-15 01:28:55,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:55,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:55,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:55,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:55,127 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:55,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:55,127 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:55,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:55,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:55,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:55,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:55,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:55,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:55,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:55,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:55,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:55,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:55,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:55,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:55,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:55,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:55,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:55,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:55,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:55,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:55,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:55,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:55,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:55,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:55,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:55,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:55,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:55,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:55,428 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:55,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-10-15 01:28:55,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b187b10d2/775f84bcfdf7426f913aa41d1c904eda/FLAG4467d78c6 [2019-10-15 01:28:56,005 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:56,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.05.cil.c [2019-10-15 01:28:56,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b187b10d2/775f84bcfdf7426f913aa41d1c904eda/FLAG4467d78c6 [2019-10-15 01:28:56,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b187b10d2/775f84bcfdf7426f913aa41d1c904eda [2019-10-15 01:28:56,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:56,337 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:56,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:56,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:56,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:56,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d5ca97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56, skipping insertion in model container [2019-10-15 01:28:56,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,354 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:56,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:56,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:56,687 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:56,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:56,863 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:56,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56 WrapperNode [2019-10-15 01:28:56,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:56,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:56,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:56,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:56,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (1/1) ... [2019-10-15 01:28:56,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:56,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:56,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:56,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:56,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (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-10-15 01:28:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:56,995 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:56,996 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-15 01:28:56,997 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-15 01:28:56,997 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:56,997 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:56,997 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:56,997 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:56,998 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:57,003 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:57,004 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:57,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:57,876 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:57,876 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-15 01:28:57,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:57 BoogieIcfgContainer [2019-10-15 01:28:57,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:57,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:57,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:57,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:57,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:56" (1/3) ... [2019-10-15 01:28:57,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40677b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:57, skipping insertion in model container [2019-10-15 01:28:57,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:56" (2/3) ... [2019-10-15 01:28:57,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40677b20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:57, skipping insertion in model container [2019-10-15 01:28:57,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:57" (3/3) ... [2019-10-15 01:28:57,887 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2019-10-15 01:28:57,897 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:57,907 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:57,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:57,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:57,949 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:57,949 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:57,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:57,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:57,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:57,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:57,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2019-10-15 01:28:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:28:57,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:57,995 INFO L380 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] [2019-10-15 01:28:57,997 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1433392200, now seen corresponding path program 1 times [2019-10-15 01:28:58,012 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659687563] [2019-10-15 01:28:58,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:58,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659687563] [2019-10-15 01:28:58,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:58,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177676500] [2019-10-15 01:28:58,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:58,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:58,466 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 4 states. [2019-10-15 01:28:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,756 INFO L93 Difference]: Finished difference Result 499 states and 743 transitions. [2019-10-15 01:28:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:58,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:28:58,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,774 INFO L225 Difference]: With dead ends: 499 [2019-10-15 01:28:58,774 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:28:58,780 INFO L600 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-10-15 01:28:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:28:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-10-15 01:28:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:28:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 350 transitions. [2019-10-15 01:28:58,857 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 350 transitions. Word has length 135 [2019-10-15 01:28:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,859 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 350 transitions. [2019-10-15 01:28:58,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 350 transitions. [2019-10-15 01:28:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:28:58,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,864 INFO L380 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] [2019-10-15 01:28:58,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1139572410, now seen corresponding path program 1 times [2019-10-15 01:28:58,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070161402] [2019-10-15 01:28:58,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:59,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070161402] [2019-10-15 01:28:59,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:59,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914991817] [2019-10-15 01:28:59,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:59,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:59,072 INFO L87 Difference]: Start difference. First operand 250 states and 350 transitions. Second operand 5 states. [2019-10-15 01:28:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:59,740 INFO L93 Difference]: Finished difference Result 517 states and 744 transitions. [2019-10-15 01:28:59,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:59,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:28:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:59,745 INFO L225 Difference]: With dead ends: 517 [2019-10-15 01:28:59,745 INFO L226 Difference]: Without dead ends: 290 [2019-10-15 01:28:59,747 INFO L600 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-10-15 01:28:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-15 01:28:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 250. [2019-10-15 01:28:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:28:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 349 transitions. [2019-10-15 01:28:59,786 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 349 transitions. Word has length 135 [2019-10-15 01:28:59,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,787 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 349 transitions. [2019-10-15 01:28:59,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 349 transitions. [2019-10-15 01:28:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:28:59,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,792 INFO L380 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] [2019-10-15 01:28:59,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1024044164, now seen corresponding path program 1 times [2019-10-15 01:28:59,793 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079392478] [2019-10-15 01:28:59,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,793 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:59,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079392478] [2019-10-15 01:28:59,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:59,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:59,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827824108] [2019-10-15 01:28:59,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:59,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:59,944 INFO L87 Difference]: Start difference. First operand 250 states and 349 transitions. Second operand 5 states. [2019-10-15 01:29:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,570 INFO L93 Difference]: Finished difference Result 517 states and 743 transitions. [2019-10-15 01:29:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:00,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,574 INFO L225 Difference]: With dead ends: 517 [2019-10-15 01:29:00,574 INFO L226 Difference]: Without dead ends: 290 [2019-10-15 01:29:00,576 INFO L600 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-10-15 01:29:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-10-15 01:29:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 250. [2019-10-15 01:29:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 348 transitions. [2019-10-15 01:29:00,602 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 348 transitions. Word has length 135 [2019-10-15 01:29:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:00,602 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 348 transitions. [2019-10-15 01:29:00,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 348 transitions. [2019-10-15 01:29:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:00,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:00,606 INFO L380 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] [2019-10-15 01:29:00,606 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash -14540410, now seen corresponding path program 1 times [2019-10-15 01:29:00,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:00,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476607714] [2019-10-15 01:29:00,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:00,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:00,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476607714] [2019-10-15 01:29:00,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:00,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:00,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067515098] [2019-10-15 01:29:00,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:00,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:00,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:00,734 INFO L87 Difference]: Start difference. First operand 250 states and 348 transitions. Second operand 5 states. [2019-10-15 01:29:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,307 INFO L93 Difference]: Finished difference Result 515 states and 737 transitions. [2019-10-15 01:29:01,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:01,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,311 INFO L225 Difference]: With dead ends: 515 [2019-10-15 01:29:01,312 INFO L226 Difference]: Without dead ends: 288 [2019-10-15 01:29:01,313 INFO L600 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-10-15 01:29:01,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-10-15 01:29:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-10-15 01:29:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2019-10-15 01:29:01,336 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 135 [2019-10-15 01:29:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,336 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2019-10-15 01:29:01,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2019-10-15 01:29:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:01,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,339 INFO L380 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] [2019-10-15 01:29:01,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1987705788, now seen corresponding path program 1 times [2019-10-15 01:29:01,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006292688] [2019-10-15 01:29:01,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:01,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006292688] [2019-10-15 01:29:01,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:01,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:01,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571800342] [2019-10-15 01:29:01,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:01,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:01,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:01,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:01,420 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand 5 states. [2019-10-15 01:29:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:01,939 INFO L93 Difference]: Finished difference Result 513 states and 731 transitions. [2019-10-15 01:29:01,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:01,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:01,942 INFO L225 Difference]: With dead ends: 513 [2019-10-15 01:29:01,943 INFO L226 Difference]: Without dead ends: 286 [2019-10-15 01:29:01,944 INFO L600 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-10-15 01:29:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-15 01:29:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 250. [2019-10-15 01:29:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 346 transitions. [2019-10-15 01:29:01,964 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 346 transitions. Word has length 135 [2019-10-15 01:29:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,965 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 346 transitions. [2019-10-15 01:29:01,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 346 transitions. [2019-10-15 01:29:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:01,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,967 INFO L380 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] [2019-10-15 01:29:01,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash 165401030, now seen corresponding path program 1 times [2019-10-15 01:29:01,969 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679889551] [2019-10-15 01:29:01,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:02,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679889551] [2019-10-15 01:29:02,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:02,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:02,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298004328] [2019-10-15 01:29:02,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:02,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:02,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:02,044 INFO L87 Difference]: Start difference. First operand 250 states and 346 transitions. Second operand 5 states. [2019-10-15 01:29:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,609 INFO L93 Difference]: Finished difference Result 511 states and 725 transitions. [2019-10-15 01:29:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:02,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,611 INFO L225 Difference]: With dead ends: 511 [2019-10-15 01:29:02,612 INFO L226 Difference]: Without dead ends: 284 [2019-10-15 01:29:02,613 INFO L600 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-10-15 01:29:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-15 01:29:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 250. [2019-10-15 01:29:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 345 transitions. [2019-10-15 01:29:02,633 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 345 transitions. Word has length 135 [2019-10-15 01:29:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:02,634 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 345 transitions. [2019-10-15 01:29:02,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 345 transitions. [2019-10-15 01:29:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:02,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:02,636 INFO L380 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] [2019-10-15 01:29:02,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:02,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -457880572, now seen corresponding path program 1 times [2019-10-15 01:29:02,637 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:02,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843690413] [2019-10-15 01:29:02,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:02,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843690413] [2019-10-15 01:29:02,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:02,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:02,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123497538] [2019-10-15 01:29:02,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:02,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:02,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:02,707 INFO L87 Difference]: Start difference. First operand 250 states and 345 transitions. Second operand 5 states. [2019-10-15 01:29:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,240 INFO L93 Difference]: Finished difference Result 509 states and 719 transitions. [2019-10-15 01:29:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:03,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,245 INFO L225 Difference]: With dead ends: 509 [2019-10-15 01:29:03,245 INFO L226 Difference]: Without dead ends: 282 [2019-10-15 01:29:03,247 INFO L600 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-10-15 01:29:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-15 01:29:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 250. [2019-10-15 01:29:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 344 transitions. [2019-10-15 01:29:03,283 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 344 transitions. Word has length 135 [2019-10-15 01:29:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,283 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 344 transitions. [2019-10-15 01:29:03,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 344 transitions. [2019-10-15 01:29:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:03,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,288 INFO L380 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] [2019-10-15 01:29:03,289 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -339439098, now seen corresponding path program 1 times [2019-10-15 01:29:03,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052636621] [2019-10-15 01:29:03,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:03,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052636621] [2019-10-15 01:29:03,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:03,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:03,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598963382] [2019-10-15 01:29:03,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:03,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:03,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:03,426 INFO L87 Difference]: Start difference. First operand 250 states and 344 transitions. Second operand 5 states. [2019-10-15 01:29:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:03,931 INFO L93 Difference]: Finished difference Result 535 states and 763 transitions. [2019-10-15 01:29:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:03,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:03,936 INFO L225 Difference]: With dead ends: 535 [2019-10-15 01:29:03,936 INFO L226 Difference]: Without dead ends: 308 [2019-10-15 01:29:03,938 INFO L600 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-10-15 01:29:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-15 01:29:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 250. [2019-10-15 01:29:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:03,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 343 transitions. [2019-10-15 01:29:03,968 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 343 transitions. Word has length 135 [2019-10-15 01:29:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,969 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 343 transitions. [2019-10-15 01:29:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 343 transitions. [2019-10-15 01:29:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:03,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,975 INFO L380 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] [2019-10-15 01:29:03,978 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1049854916, now seen corresponding path program 1 times [2019-10-15 01:29:03,979 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111061798] [2019-10-15 01:29:03,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:04,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111061798] [2019-10-15 01:29:04,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:04,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:04,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053345789] [2019-10-15 01:29:04,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:04,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:04,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:04,054 INFO L87 Difference]: Start difference. First operand 250 states and 343 transitions. Second operand 5 states. [2019-10-15 01:29:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:04,589 INFO L93 Difference]: Finished difference Result 531 states and 753 transitions. [2019-10-15 01:29:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:04,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:04,593 INFO L225 Difference]: With dead ends: 531 [2019-10-15 01:29:04,593 INFO L226 Difference]: Without dead ends: 304 [2019-10-15 01:29:04,594 INFO L600 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-10-15 01:29:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-15 01:29:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 250. [2019-10-15 01:29:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 342 transitions. [2019-10-15 01:29:04,619 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 342 transitions. Word has length 135 [2019-10-15 01:29:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:04,620 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 342 transitions. [2019-10-15 01:29:04,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 342 transitions. [2019-10-15 01:29:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:04,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:04,622 INFO L380 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] [2019-10-15 01:29:04,622 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash -816853758, now seen corresponding path program 1 times [2019-10-15 01:29:04,623 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:04,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514495717] [2019-10-15 01:29:04,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:04,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514495717] [2019-10-15 01:29:04,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:04,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:04,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327858220] [2019-10-15 01:29:04,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:04,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:04,716 INFO L87 Difference]: Start difference. First operand 250 states and 342 transitions. Second operand 5 states. [2019-10-15 01:29:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,203 INFO L93 Difference]: Finished difference Result 529 states and 747 transitions. [2019-10-15 01:29:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:05,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,206 INFO L225 Difference]: With dead ends: 529 [2019-10-15 01:29:05,206 INFO L226 Difference]: Without dead ends: 302 [2019-10-15 01:29:05,207 INFO L600 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-10-15 01:29:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-15 01:29:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 250. [2019-10-15 01:29:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2019-10-15 01:29:05,232 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 135 [2019-10-15 01:29:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,232 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2019-10-15 01:29:05,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2019-10-15 01:29:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:05,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,235 INFO L380 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] [2019-10-15 01:29:05,235 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2123996156, now seen corresponding path program 1 times [2019-10-15 01:29:05,235 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:05,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105071728] [2019-10-15 01:29:05,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,236 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:05,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105071728] [2019-10-15 01:29:05,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:05,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:05,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384125078] [2019-10-15 01:29:05,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:05,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:05,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:05,325 INFO L87 Difference]: Start difference. First operand 250 states and 341 transitions. Second operand 5 states. [2019-10-15 01:29:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,791 INFO L93 Difference]: Finished difference Result 527 states and 741 transitions. [2019-10-15 01:29:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:05,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,794 INFO L225 Difference]: With dead ends: 527 [2019-10-15 01:29:05,794 INFO L226 Difference]: Without dead ends: 300 [2019-10-15 01:29:05,796 INFO L600 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-10-15 01:29:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-15 01:29:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2019-10-15 01:29:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:29:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 340 transitions. [2019-10-15 01:29:05,822 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 340 transitions. Word has length 135 [2019-10-15 01:29:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:05,822 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 340 transitions. [2019-10-15 01:29:05,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 340 transitions. [2019-10-15 01:29:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:05,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:05,825 INFO L380 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] [2019-10-15 01:29:05,826 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash -226499390, now seen corresponding path program 1 times [2019-10-15 01:29:05,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:05,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683901472] [2019-10-15 01:29:05,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:05,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:05,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683901472] [2019-10-15 01:29:05,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:05,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:05,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773059473] [2019-10-15 01:29:05,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:05,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:05,905 INFO L87 Difference]: Start difference. First operand 250 states and 340 transitions. Second operand 4 states. [2019-10-15 01:29:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,175 INFO L93 Difference]: Finished difference Result 694 states and 977 transitions. [2019-10-15 01:29:06,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:06,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:29:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,178 INFO L225 Difference]: With dead ends: 694 [2019-10-15 01:29:06,178 INFO L226 Difference]: Without dead ends: 468 [2019-10-15 01:29:06,179 INFO L600 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-10-15 01:29:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-10-15 01:29:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 463. [2019-10-15 01:29:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-15 01:29:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 630 transitions. [2019-10-15 01:29:06,237 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 630 transitions. Word has length 135 [2019-10-15 01:29:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,237 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 630 transitions. [2019-10-15 01:29:06,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 630 transitions. [2019-10-15 01:29:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:06,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,239 INFO L380 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] [2019-10-15 01:29:06,239 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,240 INFO L82 PathProgramCache]: Analyzing trace with hash 890685571, now seen corresponding path program 1 times [2019-10-15 01:29:06,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462351575] [2019-10-15 01:29:06,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:06,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462351575] [2019-10-15 01:29:06,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:06,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:06,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85437288] [2019-10-15 01:29:06,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:06,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:06,316 INFO L87 Difference]: Start difference. First operand 463 states and 630 transitions. Second operand 4 states. [2019-10-15 01:29:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,583 INFO L93 Difference]: Finished difference Result 1328 states and 1870 transitions. [2019-10-15 01:29:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:06,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:29:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,590 INFO L225 Difference]: With dead ends: 1328 [2019-10-15 01:29:06,590 INFO L226 Difference]: Without dead ends: 889 [2019-10-15 01:29:06,593 INFO L600 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-10-15 01:29:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2019-10-15 01:29:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 882. [2019-10-15 01:29:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-10-15 01:29:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1199 transitions. [2019-10-15 01:29:06,669 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1199 transitions. Word has length 135 [2019-10-15 01:29:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:06,670 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1199 transitions. [2019-10-15 01:29:06,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1199 transitions. [2019-10-15 01:29:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:06,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:06,672 INFO L380 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] [2019-10-15 01:29:06,673 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 435779490, now seen corresponding path program 1 times [2019-10-15 01:29:06,673 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:06,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228612634] [2019-10-15 01:29:06,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:06,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:06,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228612634] [2019-10-15 01:29:06,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:06,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:06,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946808885] [2019-10-15 01:29:06,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:06,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:06,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:06,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:06,751 INFO L87 Difference]: Start difference. First operand 882 states and 1199 transitions. Second operand 6 states. [2019-10-15 01:29:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:06,869 INFO L93 Difference]: Finished difference Result 1778 states and 2480 transitions. [2019-10-15 01:29:06,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:06,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-15 01:29:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:06,877 INFO L225 Difference]: With dead ends: 1778 [2019-10-15 01:29:06,877 INFO L226 Difference]: Without dead ends: 920 [2019-10-15 01:29:06,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-10-15 01:29:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 892. [2019-10-15 01:29:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-10-15 01:29:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1207 transitions. [2019-10-15 01:29:07,018 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1207 transitions. Word has length 135 [2019-10-15 01:29:07,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:07,019 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1207 transitions. [2019-10-15 01:29:07,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:07,019 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1207 transitions. [2019-10-15 01:29:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:07,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:07,021 INFO L380 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] [2019-10-15 01:29:07,021 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1274813152, now seen corresponding path program 1 times [2019-10-15 01:29:07,021 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:07,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919967961] [2019-10-15 01:29:07,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:07,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919967961] [2019-10-15 01:29:07,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:07,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:07,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142971403] [2019-10-15 01:29:07,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:07,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:07,103 INFO L87 Difference]: Start difference. First operand 892 states and 1207 transitions. Second operand 4 states. [2019-10-15 01:29:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:07,436 INFO L93 Difference]: Finished difference Result 2603 states and 3647 transitions. [2019-10-15 01:29:07,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:07,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:29:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:07,447 INFO L225 Difference]: With dead ends: 2603 [2019-10-15 01:29:07,447 INFO L226 Difference]: Without dead ends: 1735 [2019-10-15 01:29:07,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-10-15 01:29:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1724. [2019-10-15 01:29:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-10-15 01:29:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2331 transitions. [2019-10-15 01:29:07,594 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2331 transitions. Word has length 135 [2019-10-15 01:29:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:07,594 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 2331 transitions. [2019-10-15 01:29:07,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2331 transitions. [2019-10-15 01:29:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:07,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:07,596 INFO L380 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] [2019-10-15 01:29:07,596 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1415912673, now seen corresponding path program 1 times [2019-10-15 01:29:07,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:07,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277829217] [2019-10-15 01:29:07,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:07,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:07,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277829217] [2019-10-15 01:29:07,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:07,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:29:07,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67597386] [2019-10-15 01:29:07,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:29:07,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:07,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:29:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:07,686 INFO L87 Difference]: Start difference. First operand 1724 states and 2331 transitions. Second operand 4 states. [2019-10-15 01:29:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:08,309 INFO L93 Difference]: Finished difference Result 5075 states and 7121 transitions. [2019-10-15 01:29:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:29:08,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:29:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:08,339 INFO L225 Difference]: With dead ends: 5075 [2019-10-15 01:29:08,339 INFO L226 Difference]: Without dead ends: 3375 [2019-10-15 01:29:08,354 INFO L600 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-10-15 01:29:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states. [2019-10-15 01:29:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3356. [2019-10-15 01:29:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3356 states. [2019-10-15 01:29:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4541 transitions. [2019-10-15 01:29:08,802 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4541 transitions. Word has length 135 [2019-10-15 01:29:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:08,803 INFO L462 AbstractCegarLoop]: Abstraction has 3356 states and 4541 transitions. [2019-10-15 01:29:08,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:29:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4541 transitions. [2019-10-15 01:29:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:08,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:08,805 INFO L380 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] [2019-10-15 01:29:08,805 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 237938112, now seen corresponding path program 1 times [2019-10-15 01:29:08,806 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:08,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038229508] [2019-10-15 01:29:08,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:08,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038229508] [2019-10-15 01:29:08,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:08,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:08,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025288910] [2019-10-15 01:29:08,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:08,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:08,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:08,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:08,869 INFO L87 Difference]: Start difference. First operand 3356 states and 4541 transitions. Second operand 6 states. [2019-10-15 01:29:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:09,215 INFO L93 Difference]: Finished difference Result 6792 states and 9436 transitions. [2019-10-15 01:29:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:09,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-15 01:29:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:09,242 INFO L225 Difference]: With dead ends: 6792 [2019-10-15 01:29:09,242 INFO L226 Difference]: Without dead ends: 3460 [2019-10-15 01:29:09,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2019-10-15 01:29:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3396. [2019-10-15 01:29:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-10-15 01:29:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4573 transitions. [2019-10-15 01:29:09,605 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4573 transitions. Word has length 135 [2019-10-15 01:29:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:09,605 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4573 transitions. [2019-10-15 01:29:09,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4573 transitions. [2019-10-15 01:29:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:09,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:09,607 INFO L380 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] [2019-10-15 01:29:09,607 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:09,608 INFO L82 PathProgramCache]: Analyzing trace with hash 439762046, now seen corresponding path program 1 times [2019-10-15 01:29:09,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:09,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767874038] [2019-10-15 01:29:09,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:09,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:09,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767874038] [2019-10-15 01:29:09,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:09,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:29:09,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941845327] [2019-10-15 01:29:09,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:29:09,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:09,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:29:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:09,675 INFO L87 Difference]: Start difference. First operand 3396 states and 4573 transitions. Second operand 6 states. [2019-10-15 01:29:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:10,008 INFO L93 Difference]: Finished difference Result 6880 states and 9501 transitions. [2019-10-15 01:29:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:10,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-15 01:29:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:10,032 INFO L225 Difference]: With dead ends: 6880 [2019-10-15 01:29:10,032 INFO L226 Difference]: Without dead ends: 3508 [2019-10-15 01:29:10,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-10-15 01:29:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3476. [2019-10-15 01:29:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-10-15 01:29:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 4653 transitions. [2019-10-15 01:29:10,332 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 4653 transitions. Word has length 135 [2019-10-15 01:29:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:10,334 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 4653 transitions. [2019-10-15 01:29:10,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:29:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 4653 transitions. [2019-10-15 01:29:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:10,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:10,337 INFO L380 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] [2019-10-15 01:29:10,338 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 687908540, now seen corresponding path program 1 times [2019-10-15 01:29:10,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:10,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704411661] [2019-10-15 01:29:10,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:10,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:10,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:10,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704411661] [2019-10-15 01:29:10,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:10,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:10,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128995613] [2019-10-15 01:29:10,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:10,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:10,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:10,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:10,500 INFO L87 Difference]: Start difference. First operand 3476 states and 4653 transitions. Second operand 5 states. [2019-10-15 01:29:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:11,545 INFO L93 Difference]: Finished difference Result 8519 states and 11646 transitions. [2019-10-15 01:29:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:29:11,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:11,575 INFO L225 Difference]: With dead ends: 8519 [2019-10-15 01:29:11,575 INFO L226 Difference]: Without dead ends: 5068 [2019-10-15 01:29:11,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2019-10-15 01:29:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 4716. [2019-10-15 01:29:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-10-15 01:29:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 6133 transitions. [2019-10-15 01:29:12,048 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 6133 transitions. Word has length 135 [2019-10-15 01:29:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:12,048 INFO L462 AbstractCegarLoop]: Abstraction has 4716 states and 6133 transitions. [2019-10-15 01:29:12,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 6133 transitions. [2019-10-15 01:29:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:12,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:12,050 INFO L380 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] [2019-10-15 01:29:12,051 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:12,051 INFO L82 PathProgramCache]: Analyzing trace with hash -341450758, now seen corresponding path program 1 times [2019-10-15 01:29:12,051 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:12,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228642201] [2019-10-15 01:29:12,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:12,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228642201] [2019-10-15 01:29:12,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:12,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:12,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103406412] [2019-10-15 01:29:12,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:12,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:12,125 INFO L87 Difference]: Start difference. First operand 4716 states and 6133 transitions. Second operand 5 states. [2019-10-15 01:29:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:13,075 INFO L93 Difference]: Finished difference Result 9407 states and 12281 transitions. [2019-10-15 01:29:13,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:13,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:13,107 INFO L225 Difference]: With dead ends: 9407 [2019-10-15 01:29:13,108 INFO L226 Difference]: Without dead ends: 4716 [2019-10-15 01:29:13,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 01:29:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-10-15 01:29:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-10-15 01:29:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-10-15 01:29:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 6093 transitions. [2019-10-15 01:29:13,465 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 6093 transitions. Word has length 135 [2019-10-15 01:29:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:13,466 INFO L462 AbstractCegarLoop]: Abstraction has 4716 states and 6093 transitions. [2019-10-15 01:29:13,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 6093 transitions. [2019-10-15 01:29:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:13,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:13,468 INFO L380 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] [2019-10-15 01:29:13,468 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 318080764, now seen corresponding path program 1 times [2019-10-15 01:29:13,468 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:13,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944370159] [2019-10-15 01:29:13,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:13,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944370159] [2019-10-15 01:29:13,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:13,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:13,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413273391] [2019-10-15 01:29:13,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:13,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:13,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:13,553 INFO L87 Difference]: Start difference. First operand 4716 states and 6093 transitions. Second operand 5 states. [2019-10-15 01:29:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:14,398 INFO L93 Difference]: Finished difference Result 9407 states and 12201 transitions. [2019-10-15 01:29:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:14,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:14,416 INFO L225 Difference]: With dead ends: 9407 [2019-10-15 01:29:14,416 INFO L226 Difference]: Without dead ends: 4716 [2019-10-15 01:29:14,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-10-15 01:29:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-10-15 01:29:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-10-15 01:29:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 6053 transitions. [2019-10-15 01:29:14,704 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 6053 transitions. Word has length 135 [2019-10-15 01:29:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:14,704 INFO L462 AbstractCegarLoop]: Abstraction has 4716 states and 6053 transitions. [2019-10-15 01:29:14,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 6053 transitions. [2019-10-15 01:29:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:14,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:14,706 INFO L380 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] [2019-10-15 01:29:14,707 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash -76286022, now seen corresponding path program 1 times [2019-10-15 01:29:14,707 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:14,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354773211] [2019-10-15 01:29:14,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:14,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:14,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354773211] [2019-10-15 01:29:14,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:14,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:14,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080155797] [2019-10-15 01:29:14,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:14,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:14,781 INFO L87 Difference]: Start difference. First operand 4716 states and 6053 transitions. Second operand 5 states. [2019-10-15 01:29:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:15,668 INFO L93 Difference]: Finished difference Result 9407 states and 12121 transitions. [2019-10-15 01:29:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:15,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:15,685 INFO L225 Difference]: With dead ends: 9407 [2019-10-15 01:29:15,685 INFO L226 Difference]: Without dead ends: 4716 [2019-10-15 01:29:15,694 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 01:29:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-10-15 01:29:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-10-15 01:29:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-10-15 01:29:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 6013 transitions. [2019-10-15 01:29:16,000 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 6013 transitions. Word has length 135 [2019-10-15 01:29:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:16,000 INFO L462 AbstractCegarLoop]: Abstraction has 4716 states and 6013 transitions. [2019-10-15 01:29:16,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 6013 transitions. [2019-10-15 01:29:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:16,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:16,002 INFO L380 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] [2019-10-15 01:29:16,002 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:16,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:16,003 INFO L82 PathProgramCache]: Analyzing trace with hash -920291524, now seen corresponding path program 1 times [2019-10-15 01:29:16,003 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:16,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131824379] [2019-10-15 01:29:16,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,003 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:16,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:16,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131824379] [2019-10-15 01:29:16,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:16,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:16,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218201196] [2019-10-15 01:29:16,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:16,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:16,066 INFO L87 Difference]: Start difference. First operand 4716 states and 6013 transitions. Second operand 5 states. [2019-10-15 01:29:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:16,849 INFO L93 Difference]: Finished difference Result 9407 states and 12041 transitions. [2019-10-15 01:29:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:29:16,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:16,865 INFO L225 Difference]: With dead ends: 9407 [2019-10-15 01:29:16,865 INFO L226 Difference]: Without dead ends: 4716 [2019-10-15 01:29:16,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-15 01:29:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-10-15 01:29:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-10-15 01:29:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-10-15 01:29:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 5973 transitions. [2019-10-15 01:29:17,147 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 5973 transitions. Word has length 135 [2019-10-15 01:29:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:17,147 INFO L462 AbstractCegarLoop]: Abstraction has 4716 states and 5973 transitions. [2019-10-15 01:29:17,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 5973 transitions. [2019-10-15 01:29:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:17,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:17,149 INFO L380 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] [2019-10-15 01:29:17,149 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1130692474, now seen corresponding path program 1 times [2019-10-15 01:29:17,149 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:17,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977233861] [2019-10-15 01:29:17,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:17,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:17,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977233861] [2019-10-15 01:29:17,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:17,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:17,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269934601] [2019-10-15 01:29:17,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:17,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:17,223 INFO L87 Difference]: Start difference. First operand 4716 states and 5973 transitions. Second operand 5 states. [2019-10-15 01:29:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:18,393 INFO L93 Difference]: Finished difference Result 10119 states and 13047 transitions. [2019-10-15 01:29:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:18,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:18,436 INFO L225 Difference]: With dead ends: 10119 [2019-10-15 01:29:18,436 INFO L226 Difference]: Without dead ends: 5428 [2019-10-15 01:29:18,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-10-15 01:29:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5428 states. [2019-10-15 01:29:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5428 to 5424. [2019-10-15 01:29:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5424 states. [2019-10-15 01:29:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 6841 transitions. [2019-10-15 01:29:19,365 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 6841 transitions. Word has length 135 [2019-10-15 01:29:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:19,366 INFO L462 AbstractCegarLoop]: Abstraction has 5424 states and 6841 transitions. [2019-10-15 01:29:19,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 6841 transitions. [2019-10-15 01:29:19,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:19,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:19,369 INFO L380 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] [2019-10-15 01:29:19,369 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:19,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1405452088, now seen corresponding path program 1 times [2019-10-15 01:29:19,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:19,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345793674] [2019-10-15 01:29:19,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:19,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:19,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345793674] [2019-10-15 01:29:19,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:19,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:19,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969532282] [2019-10-15 01:29:19,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:19,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:19,482 INFO L87 Difference]: Start difference. First operand 5424 states and 6841 transitions. Second operand 5 states. [2019-10-15 01:29:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:21,725 INFO L93 Difference]: Finished difference Result 12877 states and 16943 transitions. [2019-10-15 01:29:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:29:21,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:21,750 INFO L225 Difference]: With dead ends: 12877 [2019-10-15 01:29:21,750 INFO L226 Difference]: Without dead ends: 7478 [2019-10-15 01:29:21,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:29:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7478 states. [2019-10-15 01:29:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7478 to 6890. [2019-10-15 01:29:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6890 states. [2019-10-15 01:29:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6890 states to 6890 states and 8515 transitions. [2019-10-15 01:29:22,300 INFO L78 Accepts]: Start accepts. Automaton has 6890 states and 8515 transitions. Word has length 135 [2019-10-15 01:29:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:22,302 INFO L462 AbstractCegarLoop]: Abstraction has 6890 states and 8515 transitions. [2019-10-15 01:29:22,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 6890 states and 8515 transitions. [2019-10-15 01:29:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:22,303 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:22,303 INFO L380 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] [2019-10-15 01:29:22,304 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2107051962, now seen corresponding path program 1 times [2019-10-15 01:29:22,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:22,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947500832] [2019-10-15 01:29:22,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:22,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:22,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:22,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947500832] [2019-10-15 01:29:22,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:22,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:22,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439663079] [2019-10-15 01:29:22,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:22,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:22,375 INFO L87 Difference]: Start difference. First operand 6890 states and 8515 transitions. Second operand 5 states. [2019-10-15 01:29:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:23,450 INFO L93 Difference]: Finished difference Result 14653 states and 18770 transitions. [2019-10-15 01:29:23,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:23,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:23,474 INFO L225 Difference]: With dead ends: 14653 [2019-10-15 01:29:23,474 INFO L226 Difference]: Without dead ends: 7790 [2019-10-15 01:29:23,486 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-10-15 01:29:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7334. [2019-10-15 01:29:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7334 states. [2019-10-15 01:29:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7334 states to 7334 states and 8915 transitions. [2019-10-15 01:29:24,006 INFO L78 Accepts]: Start accepts. Automaton has 7334 states and 8915 transitions. Word has length 135 [2019-10-15 01:29:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:24,007 INFO L462 AbstractCegarLoop]: Abstraction has 7334 states and 8915 transitions. [2019-10-15 01:29:24,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7334 states and 8915 transitions. [2019-10-15 01:29:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:24,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:24,008 INFO L380 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] [2019-10-15 01:29:24,009 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2129684216, now seen corresponding path program 1 times [2019-10-15 01:29:24,009 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:24,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729094173] [2019-10-15 01:29:24,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:24,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:24,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:24,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729094173] [2019-10-15 01:29:24,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:24,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:24,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268998979] [2019-10-15 01:29:24,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:24,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:24,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:24,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:24,088 INFO L87 Difference]: Start difference. First operand 7334 states and 8915 transitions. Second operand 5 states. [2019-10-15 01:29:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:25,351 INFO L93 Difference]: Finished difference Result 15883 states and 20184 transitions. [2019-10-15 01:29:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:29:25,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:29:25,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:25,378 INFO L225 Difference]: With dead ends: 15883 [2019-10-15 01:29:25,378 INFO L226 Difference]: Without dead ends: 8574 [2019-10-15 01:29:25,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:29:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8574 states. [2019-10-15 01:29:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8574 to 7922. [2019-10-15 01:29:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2019-10-15 01:29:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 9455 transitions. [2019-10-15 01:29:26,096 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 9455 transitions. Word has length 135 [2019-10-15 01:29:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:26,096 INFO L462 AbstractCegarLoop]: Abstraction has 7922 states and 9455 transitions. [2019-10-15 01:29:26,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:29:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 9455 transitions. [2019-10-15 01:29:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:29:26,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:26,098 INFO L380 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] [2019-10-15 01:29:26,098 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -779079686, now seen corresponding path program 1 times [2019-10-15 01:29:26,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:26,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536797673] [2019-10-15 01:29:26,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:26,099 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:26,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:29:26,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536797673] [2019-10-15 01:29:26,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:29:26,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:29:26,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930421073] [2019-10-15 01:29:26,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:29:26,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:29:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:26,179 INFO L87 Difference]: Start difference. First operand 7922 states and 9455 transitions. Second operand 5 states.