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/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:33,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:33,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:33,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:33,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:33,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:33,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:33,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:33,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:33,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:33,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:33,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:33,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:33,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:33,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:33,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:33,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:33,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:33,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:33,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:33,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:33,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:33,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:33,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:33,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:33,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:33,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:33,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:33,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:33,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:33,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:33,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:33,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:33,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:33,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:33,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:33,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:33,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:33,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:33,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:33,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:33,765 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:33,791 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:33,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:33,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:33,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:33,794 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:33,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:33,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:33,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:33,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:33,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:33,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:33,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:33,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:33,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:33,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:33,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:33,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:33,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:33,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:33,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:33,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:33,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:33,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:33,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:33,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:33,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:33,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:33,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:33,800 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:34,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:34,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:34,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:34,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:34,112 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:34,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-15 01:28:34,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993208e83/ffe4225b3cc24f82be4c1edc16354ff6/FLAGa72cf057e [2019-10-15 01:28:34,714 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:34,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-15 01:28:34,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993208e83/ffe4225b3cc24f82be4c1edc16354ff6/FLAGa72cf057e [2019-10-15 01:28:35,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993208e83/ffe4225b3cc24f82be4c1edc16354ff6 [2019-10-15 01:28:35,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:35,121 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:35,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:35,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:35,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:35,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afe6458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35, skipping insertion in model container [2019-10-15 01:28:35,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:35" (1/1) ... [2019-10-15 01:28:35,145 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:35,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:35,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:35,590 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:35,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:35,808 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:35,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35 WrapperNode [2019-10-15 01:28:35,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:35,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:35,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:35,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:35,826 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:35" (1/1) ... [2019-10-15 01:28:35,826 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:35" (1/1) ... [2019-10-15 01:28:35,854 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:35" (1/1) ... [2019-10-15 01:28:35,855 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:35" (1/1) ... [2019-10-15 01:28:35,878 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:35" (1/1) ... [2019-10-15 01:28:35,897 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:35" (1/1) ... [2019-10-15 01:28:35,900 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:35" (1/1) ... [2019-10-15 01:28:35,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:35,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:35,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:35,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:35,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (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:35,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:35,972 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-15 01:28:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-15 01:28:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:35,974 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:35,975 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-15 01:28:35,975 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-15 01:28:35,975 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:35,975 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:35,976 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:35,977 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:35,977 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:35,985 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-15 01:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-15 01:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:35,986 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:35,987 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:35,988 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:35,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:35,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:36,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:36,776 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:28:36,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:36 BoogieIcfgContainer [2019-10-15 01:28:36,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:36,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:36,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:36,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:35" (1/3) ... [2019-10-15 01:28:36,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4cb0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:36, skipping insertion in model container [2019-10-15 01:28:36,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:35" (2/3) ... [2019-10-15 01:28:36,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b4cb0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:36, skipping insertion in model container [2019-10-15 01:28:36,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:36" (3/3) ... [2019-10-15 01:28:36,787 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-15 01:28:36,799 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:36,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:36,820 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:36,847 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:36,847 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:36,848 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:36,848 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:36,848 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:36,848 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:36,848 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:36,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states. [2019-10-15 01:28:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:36,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:36,887 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] [2019-10-15 01:28:36,889 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:36,894 INFO L82 PathProgramCache]: Analyzing trace with hash -604727244, now seen corresponding path program 1 times [2019-10-15 01:28:36,902 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:36,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185929633] [2019-10-15 01:28:36,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:36,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:37,298 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:37,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185929633] [2019-10-15 01:28:37,300 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:37,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:37,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633546914] [2019-10-15 01:28:37,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:37,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:37,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:37,329 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 5 states. [2019-10-15 01:28:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:37,991 INFO L93 Difference]: Finished difference Result 438 states and 656 transitions. [2019-10-15 01:28:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:37,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,024 INFO L225 Difference]: With dead ends: 438 [2019-10-15 01:28:38,024 INFO L226 Difference]: Without dead ends: 236 [2019-10-15 01:28:38,035 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:38,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-15 01:28:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-15 01:28:38,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 280 transitions. [2019-10-15 01:28:38,157 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 280 transitions. Word has length 106 [2019-10-15 01:28:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:38,159 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 280 transitions. [2019-10-15 01:28:38,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 280 transitions. [2019-10-15 01:28:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:38,174 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,174 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] [2019-10-15 01:28:38,175 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 720128950, now seen corresponding path program 1 times [2019-10-15 01:28:38,176 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345639216] [2019-10-15 01:28:38,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:38,346 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:38,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345639216] [2019-10-15 01:28:38,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:38,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:38,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598569782] [2019-10-15 01:28:38,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:38,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:38,351 INFO L87 Difference]: Start difference. First operand 202 states and 280 transitions. Second operand 5 states. [2019-10-15 01:28:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:38,882 INFO L93 Difference]: Finished difference Result 417 states and 596 transitions. [2019-10-15 01:28:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:38,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:38,886 INFO L225 Difference]: With dead ends: 417 [2019-10-15 01:28:38,886 INFO L226 Difference]: Without dead ends: 236 [2019-10-15 01:28:38,888 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:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-15 01:28:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 202. [2019-10-15 01:28:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 279 transitions. [2019-10-15 01:28:38,914 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 279 transitions. Word has length 106 [2019-10-15 01:28:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:38,914 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 279 transitions. [2019-10-15 01:28:38,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 279 transitions. [2019-10-15 01:28:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:38,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:38,917 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] [2019-10-15 01:28:38,917 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:38,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2008080396, now seen corresponding path program 1 times [2019-10-15 01:28:38,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:38,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81112695] [2019-10-15 01:28:38,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:38,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,053 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:39,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81112695] [2019-10-15 01:28:39,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:39,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371061449] [2019-10-15 01:28:39,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:39,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:39,057 INFO L87 Difference]: Start difference. First operand 202 states and 279 transitions. Second operand 5 states. [2019-10-15 01:28:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:39,562 INFO L93 Difference]: Finished difference Result 415 states and 590 transitions. [2019-10-15 01:28:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:39,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:39,566 INFO L225 Difference]: With dead ends: 415 [2019-10-15 01:28:39,566 INFO L226 Difference]: Without dead ends: 234 [2019-10-15 01:28:39,567 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:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-15 01:28:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 202. [2019-10-15 01:28:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 278 transitions. [2019-10-15 01:28:39,592 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 278 transitions. Word has length 106 [2019-10-15 01:28:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:39,592 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 278 transitions. [2019-10-15 01:28:39,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 278 transitions. [2019-10-15 01:28:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:39,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:39,595 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] [2019-10-15 01:28:39,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:39,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1229048822, now seen corresponding path program 1 times [2019-10-15 01:28:39,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:39,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344123663] [2019-10-15 01:28:39,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:39,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:39,673 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:39,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344123663] [2019-10-15 01:28:39,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:39,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:39,674 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631799903] [2019-10-15 01:28:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:39,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:39,676 INFO L87 Difference]: Start difference. First operand 202 states and 278 transitions. Second operand 5 states. [2019-10-15 01:28:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,171 INFO L93 Difference]: Finished difference Result 433 states and 618 transitions. [2019-10-15 01:28:40,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:40,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,174 INFO L225 Difference]: With dead ends: 433 [2019-10-15 01:28:40,174 INFO L226 Difference]: Without dead ends: 252 [2019-10-15 01:28:40,178 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:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-15 01:28:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 202. [2019-10-15 01:28:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 277 transitions. [2019-10-15 01:28:40,213 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 277 transitions. Word has length 106 [2019-10-15 01:28:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,214 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 277 transitions. [2019-10-15 01:28:40,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 277 transitions. [2019-10-15 01:28:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:40,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,216 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] [2019-10-15 01:28:40,216 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1469288568, now seen corresponding path program 1 times [2019-10-15 01:28:40,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321711132] [2019-10-15 01:28:40,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,352 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:40,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321711132] [2019-10-15 01:28:40,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:40,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:40,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128870996] [2019-10-15 01:28:40,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:40,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:40,355 INFO L87 Difference]: Start difference. First operand 202 states and 277 transitions. Second operand 5 states. [2019-10-15 01:28:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:40,747 INFO L93 Difference]: Finished difference Result 427 states and 607 transitions. [2019-10-15 01:28:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:40,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:40,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:40,751 INFO L225 Difference]: With dead ends: 427 [2019-10-15 01:28:40,751 INFO L226 Difference]: Without dead ends: 246 [2019-10-15 01:28:40,753 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:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-15 01:28:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-15 01:28:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 276 transitions. [2019-10-15 01:28:40,773 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 276 transitions. Word has length 106 [2019-10-15 01:28:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 276 transitions. [2019-10-15 01:28:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 276 transitions. [2019-10-15 01:28:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:40,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:40,775 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] [2019-10-15 01:28:40,776 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:40,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645066, now seen corresponding path program 1 times [2019-10-15 01:28:40,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:40,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175514112] [2019-10-15 01:28:40,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:40,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:40,840 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:40,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175514112] [2019-10-15 01:28:40,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:40,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:40,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34805572] [2019-10-15 01:28:40,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:40,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:40,843 INFO L87 Difference]: Start difference. First operand 202 states and 276 transitions. Second operand 5 states. [2019-10-15 01:28:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,301 INFO L93 Difference]: Finished difference Result 429 states and 606 transitions. [2019-10-15 01:28:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,304 INFO L225 Difference]: With dead ends: 429 [2019-10-15 01:28:41,305 INFO L226 Difference]: Without dead ends: 248 [2019-10-15 01:28:41,306 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:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-15 01:28:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 202. [2019-10-15 01:28:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2019-10-15 01:28:41,326 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 106 [2019-10-15 01:28:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,327 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2019-10-15 01:28:41,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2019-10-15 01:28:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:41,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,329 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] [2019-10-15 01:28:41,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1959579464, now seen corresponding path program 1 times [2019-10-15 01:28:41,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707341223] [2019-10-15 01:28:41,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,397 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:41,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707341223] [2019-10-15 01:28:41,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:41,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424647228] [2019-10-15 01:28:41,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:41,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:41,400 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand 5 states. [2019-10-15 01:28:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,840 INFO L93 Difference]: Finished difference Result 427 states and 600 transitions. [2019-10-15 01:28:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:41,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,843 INFO L225 Difference]: With dead ends: 427 [2019-10-15 01:28:41,843 INFO L226 Difference]: Without dead ends: 246 [2019-10-15 01:28:41,844 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:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-15 01:28:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 202. [2019-10-15 01:28:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-15 01:28:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 274 transitions. [2019-10-15 01:28:41,875 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 274 transitions. Word has length 106 [2019-10-15 01:28:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,876 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 274 transitions. [2019-10-15 01:28:41,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 274 transitions. [2019-10-15 01:28:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:41,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,878 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] [2019-10-15 01:28:41,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 258050934, now seen corresponding path program 1 times [2019-10-15 01:28:41,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355945534] [2019-10-15 01:28:41,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:41,928 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:41,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355945534] [2019-10-15 01:28:41,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:41,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:41,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235848153] [2019-10-15 01:28:41,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:41,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:41,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:41,930 INFO L87 Difference]: Start difference. First operand 202 states and 274 transitions. Second operand 6 states. [2019-10-15 01:28:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:41,970 INFO L93 Difference]: Finished difference Result 398 states and 558 transitions. [2019-10-15 01:28:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:41,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-15 01:28:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:41,973 INFO L225 Difference]: With dead ends: 398 [2019-10-15 01:28:41,973 INFO L226 Difference]: Without dead ends: 218 [2019-10-15 01:28:41,974 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:28:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-15 01:28:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 207. [2019-10-15 01:28:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-15 01:28:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2019-10-15 01:28:41,992 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 106 [2019-10-15 01:28:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:41,992 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2019-10-15 01:28:41,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2019-10-15 01:28:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:41,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:41,994 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] [2019-10-15 01:28:41,994 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -159345672, now seen corresponding path program 1 times [2019-10-15 01:28:41,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:41,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112610638] [2019-10-15 01:28:41,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:41,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,047 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:42,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112610638] [2019-10-15 01:28:42,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:42,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128975671] [2019-10-15 01:28:42,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:42,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:42,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:42,050 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand 6 states. [2019-10-15 01:28:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,092 INFO L93 Difference]: Finished difference Result 405 states and 563 transitions. [2019-10-15 01:28:42,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:42,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-15 01:28:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,094 INFO L225 Difference]: With dead ends: 405 [2019-10-15 01:28:42,095 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 01:28:42,096 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:28:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 01:28:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2019-10-15 01:28:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-15 01:28:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-15 01:28:42,113 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 106 [2019-10-15 01:28:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,113 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-15 01:28:42,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-15 01:28:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:42,115 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,115 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] [2019-10-15 01:28:42,115 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 716673334, now seen corresponding path program 1 times [2019-10-15 01:28:42,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94883697] [2019-10-15 01:28:42,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,116 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,170 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:42,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94883697] [2019-10-15 01:28:42,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:42,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757340868] [2019-10-15 01:28:42,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:42,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:42,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:42,173 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 6 states. [2019-10-15 01:28:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,212 INFO L93 Difference]: Finished difference Result 412 states and 568 transitions. [2019-10-15 01:28:42,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:42,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-15 01:28:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,215 INFO L225 Difference]: With dead ends: 412 [2019-10-15 01:28:42,215 INFO L226 Difference]: Without dead ends: 222 [2019-10-15 01:28:42,217 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:28:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-15 01:28:42,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2019-10-15 01:28:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-15 01:28:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2019-10-15 01:28:42,235 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 106 [2019-10-15 01:28:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,236 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2019-10-15 01:28:42,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2019-10-15 01:28:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:42,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,238 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] [2019-10-15 01:28:42,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1610159672, now seen corresponding path program 1 times [2019-10-15 01:28:42,238 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201072118] [2019-10-15 01:28:42,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,329 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:42,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201072118] [2019-10-15 01:28:42,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:42,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068161463] [2019-10-15 01:28:42,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:42,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:42,339 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand 6 states. [2019-10-15 01:28:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:42,408 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2019-10-15 01:28:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:42,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-10-15 01:28:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:42,412 INFO L225 Difference]: With dead ends: 419 [2019-10-15 01:28:42,413 INFO L226 Difference]: Without dead ends: 224 [2019-10-15 01:28:42,414 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:28:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-15 01:28:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2019-10-15 01:28:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-10-15 01:28:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 294 transitions. [2019-10-15 01:28:42,445 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 294 transitions. Word has length 106 [2019-10-15 01:28:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:42,447 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 294 transitions. [2019-10-15 01:28:42,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 294 transitions. [2019-10-15 01:28:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:42,450 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:42,450 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] [2019-10-15 01:28:42,451 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1215792886, now seen corresponding path program 1 times [2019-10-15 01:28:42,451 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:42,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282226303] [2019-10-15 01:28:42,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,452 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:42,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:42,588 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:42,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282226303] [2019-10-15 01:28:42,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:42,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:42,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420522219] [2019-10-15 01:28:42,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:42,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:42,590 INFO L87 Difference]: Start difference. First operand 222 states and 294 transitions. Second operand 5 states. [2019-10-15 01:28:43,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,185 INFO L93 Difference]: Finished difference Result 509 states and 675 transitions. [2019-10-15 01:28:43,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:43,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:43,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,189 INFO L225 Difference]: With dead ends: 509 [2019-10-15 01:28:43,189 INFO L226 Difference]: Without dead ends: 310 [2019-10-15 01:28:43,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:28:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-15 01:28:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 285. [2019-10-15 01:28:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-15 01:28:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 367 transitions. [2019-10-15 01:28:43,224 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 367 transitions. Word has length 106 [2019-10-15 01:28:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,225 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 367 transitions. [2019-10-15 01:28:43,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 367 transitions. [2019-10-15 01:28:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:43,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,228 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] [2019-10-15 01:28:43,228 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1490552500, now seen corresponding path program 1 times [2019-10-15 01:28:43,229 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051332034] [2019-10-15 01:28:43,229 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,230 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,332 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:43,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051332034] [2019-10-15 01:28:43,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:43,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253839591] [2019-10-15 01:28:43,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:43,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:43,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:43,337 INFO L87 Difference]: Start difference. First operand 285 states and 367 transitions. Second operand 5 states. [2019-10-15 01:28:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:43,754 INFO L93 Difference]: Finished difference Result 547 states and 706 transitions. [2019-10-15 01:28:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:43,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:43,759 INFO L225 Difference]: With dead ends: 547 [2019-10-15 01:28:43,759 INFO L226 Difference]: Without dead ends: 285 [2019-10-15 01:28:43,760 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:28:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-15 01:28:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-15 01:28:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-15 01:28:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2019-10-15 01:28:43,813 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 106 [2019-10-15 01:28:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:43,813 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2019-10-15 01:28:43,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2019-10-15 01:28:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:43,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:43,815 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] [2019-10-15 01:28:43,815 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2102814922, now seen corresponding path program 1 times [2019-10-15 01:28:43,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:43,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078895831] [2019-10-15 01:28:43,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:43,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:43,929 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:43,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078895831] [2019-10-15 01:28:43,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:43,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:43,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306388035] [2019-10-15 01:28:43,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:43,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:43,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:43,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:43,932 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand 5 states. [2019-10-15 01:28:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:44,397 INFO L93 Difference]: Finished difference Result 547 states and 702 transitions. [2019-10-15 01:28:44,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:44,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:44,400 INFO L225 Difference]: With dead ends: 547 [2019-10-15 01:28:44,401 INFO L226 Difference]: Without dead ends: 285 [2019-10-15 01:28:44,403 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:28:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-15 01:28:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-10-15 01:28:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-15 01:28:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2019-10-15 01:28:44,428 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 106 [2019-10-15 01:28:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:44,429 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2019-10-15 01:28:44,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2019-10-15 01:28:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:44,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:44,431 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] [2019-10-15 01:28:44,431 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2080182668, now seen corresponding path program 1 times [2019-10-15 01:28:44,432 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:44,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308464463] [2019-10-15 01:28:44,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:44,503 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:44,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308464463] [2019-10-15 01:28:44,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:44,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:44,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520467769] [2019-10-15 01:28:44,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:44,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:44,506 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 5 states. [2019-10-15 01:28:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,046 INFO L93 Difference]: Finished difference Result 648 states and 835 transitions. [2019-10-15 01:28:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:45,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,049 INFO L225 Difference]: With dead ends: 648 [2019-10-15 01:28:45,049 INFO L226 Difference]: Without dead ends: 386 [2019-10-15 01:28:45,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:28:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-10-15 01:28:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 368. [2019-10-15 01:28:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-15 01:28:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 466 transitions. [2019-10-15 01:28:45,084 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 466 transitions. Word has length 106 [2019-10-15 01:28:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:45,085 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 466 transitions. [2019-10-15 01:28:45,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 466 transitions. [2019-10-15 01:28:45,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:45,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:45,087 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] [2019-10-15 01:28:45,087 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:45,088 INFO L82 PathProgramCache]: Analyzing trace with hash -693979274, now seen corresponding path program 1 times [2019-10-15 01:28:45,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:45,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394795816] [2019-10-15 01:28:45,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:45,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:45,178 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:45,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394795816] [2019-10-15 01:28:45,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:45,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:45,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239052221] [2019-10-15 01:28:45,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:45,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:45,190 INFO L87 Difference]: Start difference. First operand 368 states and 466 transitions. Second operand 5 states. [2019-10-15 01:28:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:45,965 INFO L93 Difference]: Finished difference Result 856 states and 1128 transitions. [2019-10-15 01:28:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:45,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:45,970 INFO L225 Difference]: With dead ends: 856 [2019-10-15 01:28:45,970 INFO L226 Difference]: Without dead ends: 511 [2019-10-15 01:28:45,972 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:28:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-15 01:28:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 419. [2019-10-15 01:28:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-15 01:28:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 522 transitions. [2019-10-15 01:28:46,027 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 522 transitions. Word has length 106 [2019-10-15 01:28:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,028 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 522 transitions. [2019-10-15 01:28:46,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 522 transitions. [2019-10-15 01:28:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:46,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,031 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] [2019-10-15 01:28:46,031 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1203452364, now seen corresponding path program 1 times [2019-10-15 01:28:46,032 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132949594] [2019-10-15 01:28:46,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,032 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,112 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:46,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132949594] [2019-10-15 01:28:46,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:46,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488184261] [2019-10-15 01:28:46,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:46,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:46,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:46,114 INFO L87 Difference]: Start difference. First operand 419 states and 522 transitions. Second operand 5 states. [2019-10-15 01:28:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:46,747 INFO L93 Difference]: Finished difference Result 929 states and 1208 transitions. [2019-10-15 01:28:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:46,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:46,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:46,752 INFO L225 Difference]: With dead ends: 929 [2019-10-15 01:28:46,752 INFO L226 Difference]: Without dead ends: 533 [2019-10-15 01:28:46,754 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:28:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-15 01:28:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 460. [2019-10-15 01:28:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-15 01:28:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 564 transitions. [2019-10-15 01:28:46,814 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 564 transitions. Word has length 106 [2019-10-15 01:28:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:46,815 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 564 transitions. [2019-10-15 01:28:46,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 564 transitions. [2019-10-15 01:28:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:46,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:46,818 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] [2019-10-15 01:28:46,818 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash 719775670, now seen corresponding path program 1 times [2019-10-15 01:28:46,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:46,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53417816] [2019-10-15 01:28:46,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:46,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:46,917 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:46,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53417816] [2019-10-15 01:28:46,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:46,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:46,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607056538] [2019-10-15 01:28:46,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:46,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:46,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:46,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:46,922 INFO L87 Difference]: Start difference. First operand 460 states and 564 transitions. Second operand 5 states. [2019-10-15 01:28:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,560 INFO L93 Difference]: Finished difference Result 975 states and 1252 transitions. [2019-10-15 01:28:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:47,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:28:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,564 INFO L225 Difference]: With dead ends: 975 [2019-10-15 01:28:47,564 INFO L226 Difference]: Without dead ends: 538 [2019-10-15 01:28:47,566 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:28:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-15 01:28:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 491. [2019-10-15 01:28:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-15 01:28:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 592 transitions. [2019-10-15 01:28:47,618 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 592 transitions. Word has length 106 [2019-10-15 01:28:47,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,618 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 592 transitions. [2019-10-15 01:28:47,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 592 transitions. [2019-10-15 01:28:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:28:47,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,621 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] [2019-10-15 01:28:47,622 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 860324280, now seen corresponding path program 1 times [2019-10-15 01:28:47,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12438049] [2019-10-15 01:28:47,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:47,700 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:47,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12438049] [2019-10-15 01:28:47,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:47,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:47,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552855589] [2019-10-15 01:28:47,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:47,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:47,705 INFO L87 Difference]: Start difference. First operand 491 states and 592 transitions. Second operand 3 states. [2019-10-15 01:28:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:47,816 INFO L93 Difference]: Finished difference Result 1396 states and 1728 transitions. [2019-10-15 01:28:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:47,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-15 01:28:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:47,823 INFO L225 Difference]: With dead ends: 1396 [2019-10-15 01:28:47,823 INFO L226 Difference]: Without dead ends: 928 [2019-10-15 01:28:47,826 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-10-15 01:28:47,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 927. [2019-10-15 01:28:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-15 01:28:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1127 transitions. [2019-10-15 01:28:47,916 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1127 transitions. Word has length 106 [2019-10-15 01:28:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:47,918 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1127 transitions. [2019-10-15 01:28:47,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1127 transitions. [2019-10-15 01:28:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-15 01:28:47,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:47,923 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,923 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:47,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:47,924 INFO L82 PathProgramCache]: Analyzing trace with hash -525557290, now seen corresponding path program 1 times [2019-10-15 01:28:47,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:47,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884005901] [2019-10-15 01:28:47,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:47,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:48,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884005901] [2019-10-15 01:28:48,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811798593] [2019-10-15 01:28:48,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:48,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:48,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:28:48,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 01:28:48,484 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:48,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [4] total 6 [2019-10-15 01:28:48,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026618071] [2019-10-15 01:28:48,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:48,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:48,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:48,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:48,487 INFO L87 Difference]: Start difference. First operand 927 states and 1127 transitions. Second operand 4 states. [2019-10-15 01:28:48,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:48,713 INFO L93 Difference]: Finished difference Result 1829 states and 2223 transitions. [2019-10-15 01:28:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:48,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-15 01:28:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:48,721 INFO L225 Difference]: With dead ends: 1829 [2019-10-15 01:28:48,721 INFO L226 Difference]: Without dead ends: 927 [2019-10-15 01:28:48,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-10-15 01:28:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 927. [2019-10-15 01:28:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-15 01:28:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1117 transitions. [2019-10-15 01:28:48,804 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1117 transitions. Word has length 172 [2019-10-15 01:28:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:48,804 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1117 transitions. [2019-10-15 01:28:48,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1117 transitions. [2019-10-15 01:28:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-15 01:28:48,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:48,812 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:49,022 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1872823811, now seen corresponding path program 1 times [2019-10-15 01:28:49,023 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36398476] [2019-10-15 01:28:49,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 01:28:49,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36398476] [2019-10-15 01:28:49,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:49,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:49,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924989217] [2019-10-15 01:28:49,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:49,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:49,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:49,123 INFO L87 Difference]: Start difference. First operand 927 states and 1117 transitions. Second operand 4 states. [2019-10-15 01:28:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:49,449 INFO L93 Difference]: Finished difference Result 2601 states and 3154 transitions. [2019-10-15 01:28:49,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:49,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-10-15 01:28:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:49,460 INFO L225 Difference]: With dead ends: 2601 [2019-10-15 01:28:49,460 INFO L226 Difference]: Without dead ends: 1310 [2019-10-15 01:28:49,465 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:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-10-15 01:28:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2019-10-15 01:28:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-15 01:28:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1569 transitions. [2019-10-15 01:28:49,581 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1569 transitions. Word has length 171 [2019-10-15 01:28:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:49,582 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1569 transitions. [2019-10-15 01:28:49,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1569 transitions. [2019-10-15 01:28:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-15 01:28:49,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:49,589 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,589 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash 88690440, now seen corresponding path program 1 times [2019-10-15 01:28:49,590 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:49,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917475285] [2019-10-15 01:28:49,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:49,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:28:49,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917475285] [2019-10-15 01:28:49,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679743186] [2019-10-15 01:28:49,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:50,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:50,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:28:50,159 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-15 01:28:50,416 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:50,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-15 01:28:50,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906841689] [2019-10-15 01:28:50,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:50,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:50,418 INFO L87 Difference]: Start difference. First operand 1310 states and 1569 transitions. Second operand 4 states. [2019-10-15 01:28:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:50,811 INFO L93 Difference]: Finished difference Result 3278 states and 4039 transitions. [2019-10-15 01:28:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:50,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-10-15 01:28:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:50,824 INFO L225 Difference]: With dead ends: 3278 [2019-10-15 01:28:50,824 INFO L226 Difference]: Without dead ends: 1991 [2019-10-15 01:28:50,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:50,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-10-15 01:28:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-10-15 01:28:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-10-15 01:28:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2327 transitions. [2019-10-15 01:28:50,991 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2327 transitions. Word has length 224 [2019-10-15 01:28:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:50,992 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2327 transitions. [2019-10-15 01:28:50,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:50,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2327 transitions. [2019-10-15 01:28:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-15 01:28:51,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:51,003 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:51,209 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:51,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash -149883889, now seen corresponding path program 1 times [2019-10-15 01:28:51,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:51,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708611683] [2019-10-15 01:28:51,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:51,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-15 01:28:51,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708611683] [2019-10-15 01:28:51,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135647858] [2019-10-15 01:28:51,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:51,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:51,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-15 01:28:51,839 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-10-15 01:28:52,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:52,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-15 01:28:52,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269010002] [2019-10-15 01:28:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:52,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:52,185 INFO L87 Difference]: Start difference. First operand 1987 states and 2327 transitions. Second operand 3 states. [2019-10-15 01:28:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:52,398 INFO L93 Difference]: Finished difference Result 3940 states and 4629 transitions. [2019-10-15 01:28:52,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:52,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-15 01:28:52,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:52,410 INFO L225 Difference]: With dead ends: 3940 [2019-10-15 01:28:52,410 INFO L226 Difference]: Without dead ends: 1978 [2019-10-15 01:28:52,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-10-15 01:28:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-10-15 01:28:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-10-15 01:28:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2303 transitions. [2019-10-15 01:28:52,585 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2303 transitions. Word has length 352 [2019-10-15 01:28:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:52,585 INFO L462 AbstractCegarLoop]: Abstraction has 1978 states and 2303 transitions. [2019-10-15 01:28:52,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2303 transitions. [2019-10-15 01:28:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-15 01:28:52,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:52,596 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:52,810 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash -201466467, now seen corresponding path program 1 times [2019-10-15 01:28:52,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:52,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783936769] [2019-10-15 01:28:52,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:52,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 31 proven. 26 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-15 01:28:52,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783936769] [2019-10-15 01:28:52,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538619384] [2019-10-15 01:28:52,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:53,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:28:53,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-15 01:28:53,517 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-10-15 01:28:53,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:53,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-10-15 01:28:53,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967864940] [2019-10-15 01:28:53,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:53,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:28:53,886 INFO L87 Difference]: Start difference. First operand 1978 states and 2303 transitions. Second operand 6 states. [2019-10-15 01:28:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:54,109 INFO L93 Difference]: Finished difference Result 3538 states and 4145 transitions. [2019-10-15 01:28:54,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:54,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 353 [2019-10-15 01:28:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:54,122 INFO L225 Difference]: With dead ends: 3538 [2019-10-15 01:28:54,122 INFO L226 Difference]: Without dead ends: 1585 [2019-10-15 01:28:54,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 702 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:28:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-15 01:28:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1551. [2019-10-15 01:28:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551 states. [2019-10-15 01:28:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 1802 transitions. [2019-10-15 01:28:54,308 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 1802 transitions. Word has length 353 [2019-10-15 01:28:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:54,309 INFO L462 AbstractCegarLoop]: Abstraction has 1551 states and 1802 transitions. [2019-10-15 01:28:54,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 1802 transitions. [2019-10-15 01:28:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-15 01:28:54,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:54,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:54,531 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:54,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:54,532 INFO L82 PathProgramCache]: Analyzing trace with hash 228507631, now seen corresponding path program 1 times [2019-10-15 01:28:54,532 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:54,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75787425] [2019-10-15 01:28:54,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:54,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-15 01:28:54,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75787425] [2019-10-15 01:28:54,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868830421] [2019-10-15 01:28:54,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:55,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:55,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:28:55,192 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-15 01:28:55,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:55,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 7 [2019-10-15 01:28:55,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283855874] [2019-10-15 01:28:55,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:55,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:55,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:55,416 INFO L87 Difference]: Start difference. First operand 1551 states and 1802 transitions. Second operand 3 states. [2019-10-15 01:28:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:55,691 INFO L93 Difference]: Finished difference Result 4329 states and 5055 transitions. [2019-10-15 01:28:55,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:55,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-15 01:28:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:55,707 INFO L225 Difference]: With dead ends: 4329 [2019-10-15 01:28:55,707 INFO L226 Difference]: Without dead ends: 2282 [2019-10-15 01:28:55,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:28:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-10-15 01:28:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2278. [2019-10-15 01:28:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2019-10-15 01:28:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 2670 transitions. [2019-10-15 01:28:56,076 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 2670 transitions. Word has length 246 [2019-10-15 01:28:56,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:56,077 INFO L462 AbstractCegarLoop]: Abstraction has 2278 states and 2670 transitions. [2019-10-15 01:28:56,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 2670 transitions. [2019-10-15 01:28:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-15 01:28:56,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:56,094 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:56,300 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1290651702, now seen corresponding path program 1 times [2019-10-15 01:28:56,301 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:56,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413786483] [2019-10-15 01:28:56,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:56,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-15 01:28:56,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413786483] [2019-10-15 01:28:56,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425388319] [2019-10-15 01:28:56,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:56,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:56,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-15 01:28:56,802 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:28:57,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:57,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 5 [2019-10-15 01:28:57,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831998508] [2019-10-15 01:28:57,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:57,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:57,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:57,137 INFO L87 Difference]: Start difference. First operand 2278 states and 2670 transitions. Second operand 3 states. [2019-10-15 01:28:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:57,665 INFO L93 Difference]: Finished difference Result 6077 states and 7186 transitions. [2019-10-15 01:28:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:57,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-15 01:28:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:57,694 INFO L225 Difference]: With dead ends: 6077 [2019-10-15 01:28:57,694 INFO L226 Difference]: Without dead ends: 3912 [2019-10-15 01:28:57,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2019-10-15 01:28:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3896. [2019-10-15 01:28:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-15 01:28:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4581 transitions. [2019-10-15 01:28:58,112 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4581 transitions. Word has length 300 [2019-10-15 01:28:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:58,113 INFO L462 AbstractCegarLoop]: Abstraction has 3896 states and 4581 transitions. [2019-10-15 01:28:58,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4581 transitions. [2019-10-15 01:28:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-15 01:28:58,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:58,127 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:58,336 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:58,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1769493161, now seen corresponding path program 1 times [2019-10-15 01:28:58,337 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:58,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123333864] [2019-10-15 01:28:58,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:58,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-15 01:28:58,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123333864] [2019-10-15 01:28:58,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:58,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:58,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542887787] [2019-10-15 01:28:58,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:58,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:58,450 INFO L87 Difference]: Start difference. First operand 3896 states and 4581 transitions. Second operand 4 states. [2019-10-15 01:28:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:58,821 INFO L93 Difference]: Finished difference Result 7538 states and 8876 transitions. [2019-10-15 01:28:58,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:58,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2019-10-15 01:28:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:58,845 INFO L225 Difference]: With dead ends: 7538 [2019-10-15 01:28:58,845 INFO L226 Difference]: Without dead ends: 3801 [2019-10-15 01:28:58,858 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,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-10-15 01:28:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3801. [2019-10-15 01:28:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2019-10-15 01:28:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 4471 transitions. [2019-10-15 01:28:59,339 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 4471 transitions. Word has length 301 [2019-10-15 01:28:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:59,339 INFO L462 AbstractCegarLoop]: Abstraction has 3801 states and 4471 transitions. [2019-10-15 01:28:59,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 4471 transitions. [2019-10-15 01:28:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-10-15 01:28:59,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:59,356 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,356 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1471684342, now seen corresponding path program 1 times [2019-10-15 01:28:59,357 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:59,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963924123] [2019-10-15 01:28:59,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:59,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2019-10-15 01:28:59,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963924123] [2019-10-15 01:28:59,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037381129] [2019-10-15 01:28:59,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:59,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1675 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:59,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-10-15 01:28:59,976 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2019-10-15 01:29:00,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:00,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-15 01:29:00,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327126479] [2019-10-15 01:29:00,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:00,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:00,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:29:00,360 INFO L87 Difference]: Start difference. First operand 3801 states and 4471 transitions. Second operand 3 states. [2019-10-15 01:29:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:00,693 INFO L93 Difference]: Finished difference Result 8720 states and 10708 transitions. [2019-10-15 01:29:00,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:00,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-10-15 01:29:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:00,726 INFO L225 Difference]: With dead ends: 8720 [2019-10-15 01:29:00,727 INFO L226 Difference]: Without dead ends: 5078 [2019-10-15 01:29:00,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 845 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:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-10-15 01:29:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5058. [2019-10-15 01:29:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5058 states. [2019-10-15 01:29:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 6020 transitions. [2019-10-15 01:29:01,312 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 6020 transitions. Word has length 422 [2019-10-15 01:29:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:01,313 INFO L462 AbstractCegarLoop]: Abstraction has 5058 states and 6020 transitions. [2019-10-15 01:29:01,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 6020 transitions. [2019-10-15 01:29:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-15 01:29:01,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:01,341 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:01,557 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:01,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1206124256, now seen corresponding path program 1 times [2019-10-15 01:29:01,558 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:01,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437754234] [2019-10-15 01:29:01,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:01,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-15 01:29:01,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437754234] [2019-10-15 01:29:01,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798637044] [2019-10-15 01:29:01,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:02,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-15 01:29:02,112 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2019-10-15 01:29:02,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:02,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-15 01:29:02,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900726634] [2019-10-15 01:29:02,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:02,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:02,378 INFO L87 Difference]: Start difference. First operand 5058 states and 6020 transitions. Second operand 3 states. [2019-10-15 01:29:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:02,778 INFO L93 Difference]: Finished difference Result 11315 states and 14102 transitions. [2019-10-15 01:29:02,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:02,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-15 01:29:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:02,807 INFO L225 Difference]: With dead ends: 11315 [2019-10-15 01:29:02,807 INFO L226 Difference]: Without dead ends: 6506 [2019-10-15 01:29:02,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:29:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2019-10-15 01:29:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 6482. [2019-10-15 01:29:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6482 states. [2019-10-15 01:29:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 7660 transitions. [2019-10-15 01:29:03,508 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 7660 transitions. Word has length 302 [2019-10-15 01:29:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:29:03,509 INFO L462 AbstractCegarLoop]: Abstraction has 6482 states and 7660 transitions. [2019-10-15 01:29:03,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:29:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 7660 transitions. [2019-10-15 01:29:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-15 01:29:03,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:29:03,534 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:03,741 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:29:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:29:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash -848143261, now seen corresponding path program 1 times [2019-10-15 01:29:03,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:29:03,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602818288] [2019-10-15 01:29:03,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:29:03,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:29:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 14 proven. 56 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-10-15 01:29:03,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602818288] [2019-10-15 01:29:03,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62613131] [2019-10-15 01:29:03,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:29:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:29:04,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:29:04,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:29:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-15 01:29:04,195 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:29:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-10-15 01:29:04,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:29:04,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2019-10-15 01:29:04,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68554714] [2019-10-15 01:29:04,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:29:04,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:29:04,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:29:04,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:04,417 INFO L87 Difference]: Start difference. First operand 6482 states and 7660 transitions. Second operand 3 states. [2019-10-15 01:29:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:29:05,048 INFO L93 Difference]: Finished difference Result 17415 states and 21041 transitions. [2019-10-15 01:29:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:29:05,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-15 01:29:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:29:05,101 INFO L225 Difference]: With dead ends: 17415 [2019-10-15 01:29:05,101 INFO L226 Difference]: Without dead ends: 11302 [2019-10-15 01:29:05,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:29:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11302 states.