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.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:17,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:17,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:17,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:17,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:17,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:17,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:17,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:17,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:17,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:17,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:17,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:17,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:17,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:17,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:17,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:17,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:17,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:17,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:17,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:17,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:17,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:17,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:17,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:17,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:17,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:17,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:17,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:17,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:17,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:17,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:17,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:17,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:17,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:17,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:17,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:17,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:17,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:17,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:17,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:17,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:17,829 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:17,850 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:17,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:17,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:17,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:17,853 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:17,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:17,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:17,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:17,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:17,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:17,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:17,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:17,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:17,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:17,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:17,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:17,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:17,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:17,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:17,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:17,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:17,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:17,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:17,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:17,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:17,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:17,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:17,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:17,859 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:18,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:18,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:18,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:18,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:18,147 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:18,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-15 01:28:18,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40704cfd1/247300f2b5844f23a16cd4bb804e1df3/FLAG1747369c4 [2019-10-15 01:28:18,729 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:18,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-10-15 01:28:18,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40704cfd1/247300f2b5844f23a16cd4bb804e1df3/FLAG1747369c4 [2019-10-15 01:28:19,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40704cfd1/247300f2b5844f23a16cd4bb804e1df3 [2019-10-15 01:28:19,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:19,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:19,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:19,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:19,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:19,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:19" (1/1) ... [2019-10-15 01:28:19,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338e2a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:19, skipping insertion in model container [2019-10-15 01:28:19,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:19" (1/1) ... [2019-10-15 01:28:19,066 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:19,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:19,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:19,324 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:19,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:19,462 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:19,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:19 WrapperNode [2019-10-15 01:28:19,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:19,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:19,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:19,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:19,475 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:19" (1/1) ... [2019-10-15 01:28:19,475 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:19" (1/1) ... [2019-10-15 01:28:19,482 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:19" (1/1) ... [2019-10-15 01:28:19,482 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:19" (1/1) ... [2019-10-15 01:28:19,490 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:19" (1/1) ... [2019-10-15 01:28:19,500 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:19" (1/1) ... [2019-10-15 01:28:19,502 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:19" (1/1) ... [2019-10-15 01:28:19,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:19,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:19,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:19,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:19,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:19" (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:19,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-15 01:28:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:19,560 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:20,039 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:20,039 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 01:28:20,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:20 BoogieIcfgContainer [2019-10-15 01:28:20,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:20,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:20,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:20,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:20,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:19" (1/3) ... [2019-10-15 01:28:20,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413f9941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:20, skipping insertion in model container [2019-10-15 01:28:20,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:19" (2/3) ... [2019-10-15 01:28:20,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413f9941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:20, skipping insertion in model container [2019-10-15 01:28:20,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:20" (3/3) ... [2019-10-15 01:28:20,049 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-10-15 01:28:20,059 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:20,068 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:20,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:20,107 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:20,107 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:20,107 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:20,107 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:20,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:20,108 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:20,108 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:20,108 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-10-15 01:28:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:20,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-10-15 01:28:20,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108597015] [2019-10-15 01:28:20,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,490 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:20,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108597015] [2019-10-15 01:28:20,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:20,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446735312] [2019-10-15 01:28:20,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:20,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:20,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:20,519 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-10-15 01:28:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,144 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2019-10-15 01:28:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:21,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,167 INFO L225 Difference]: With dead ends: 298 [2019-10-15 01:28:21,168 INFO L226 Difference]: Without dead ends: 161 [2019-10-15 01:28:21,173 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:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-15 01:28:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-10-15 01:28:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-15 01:28:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2019-10-15 01:28:21,277 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2019-10-15 01:28:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,278 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2019-10-15 01:28:21,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2019-10-15 01:28:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:21,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,286 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] [2019-10-15 01:28:21,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash 246293706, now seen corresponding path program 1 times [2019-10-15 01:28:21,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666395069] [2019-10-15 01:28:21,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,481 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:21,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666395069] [2019-10-15 01:28:21,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:21,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112669833] [2019-10-15 01:28:21,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:21,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:21,489 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2019-10-15 01:28:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,851 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2019-10-15 01:28:21,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:21,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,855 INFO L225 Difference]: With dead ends: 277 [2019-10-15 01:28:21,855 INFO L226 Difference]: Without dead ends: 161 [2019-10-15 01:28:21,858 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:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-15 01:28:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-10-15 01:28:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-15 01:28:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2019-10-15 01:28:21,881 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2019-10-15 01:28:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,882 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2019-10-15 01:28:21,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2019-10-15 01:28:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:21,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,884 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] [2019-10-15 01:28:21,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1633079116, now seen corresponding path program 1 times [2019-10-15 01:28:21,885 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963830061] [2019-10-15 01:28:21,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,886 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,007 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:22,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963830061] [2019-10-15 01:28:22,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:22,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512641027] [2019-10-15 01:28:22,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:22,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:22,010 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2019-10-15 01:28:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,330 INFO L93 Difference]: Finished difference Result 285 states and 387 transitions. [2019-10-15 01:28:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:22,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,335 INFO L225 Difference]: With dead ends: 285 [2019-10-15 01:28:22,335 INFO L226 Difference]: Without dead ends: 169 [2019-10-15 01:28:22,336 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:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-15 01:28:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2019-10-15 01:28:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-15 01:28:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-10-15 01:28:22,357 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2019-10-15 01:28:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,357 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-10-15 01:28:22,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-10-15 01:28:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:22,361 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,361 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] [2019-10-15 01:28:22,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2076979790, now seen corresponding path program 1 times [2019-10-15 01:28:22,362 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141587961] [2019-10-15 01:28:22,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,451 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:22,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141587961] [2019-10-15 01:28:22,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:22,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545537624] [2019-10-15 01:28:22,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:22,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:22,454 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 6 states. [2019-10-15 01:28:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,490 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2019-10-15 01:28:22,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:22,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-15 01:28:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,496 INFO L225 Difference]: With dead ends: 260 [2019-10-15 01:28:22,496 INFO L226 Difference]: Without dead ends: 145 [2019-10-15 01:28:22,497 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:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-15 01:28:22,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-10-15 01:28:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-15 01:28:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2019-10-15 01:28:22,516 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 77 [2019-10-15 01:28:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,516 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2019-10-15 01:28:22,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2019-10-15 01:28:22,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:22,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,519 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] [2019-10-15 01:28:22,519 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 705172492, now seen corresponding path program 1 times [2019-10-15 01:28:22,520 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208496186] [2019-10-15 01:28:22,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,520 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,572 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:22,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208496186] [2019-10-15 01:28:22,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:22,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625605413] [2019-10-15 01:28:22,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:22,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:22,574 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 4 states. [2019-10-15 01:28:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,779 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2019-10-15 01:28:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:22,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-10-15 01:28:22,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,782 INFO L225 Difference]: With dead ends: 373 [2019-10-15 01:28:22,782 INFO L226 Difference]: Without dead ends: 253 [2019-10-15 01:28:22,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-15 01:28:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2019-10-15 01:28:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-15 01:28:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2019-10-15 01:28:22,809 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 77 [2019-10-15 01:28:22,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,810 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2019-10-15 01:28:22,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:22,810 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2019-10-15 01:28:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:22,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,812 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] [2019-10-15 01:28:22,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1830432461, now seen corresponding path program 1 times [2019-10-15 01:28:22,813 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,813 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046459067] [2019-10-15 01:28:22,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,813 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,883 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:22,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046459067] [2019-10-15 01:28:22,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:22,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855894818] [2019-10-15 01:28:22,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:22,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:22,886 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 6 states. [2019-10-15 01:28:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,952 INFO L93 Difference]: Finished difference Result 483 states and 633 transitions. [2019-10-15 01:28:22,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:22,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-10-15 01:28:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,956 INFO L225 Difference]: With dead ends: 483 [2019-10-15 01:28:22,956 INFO L226 Difference]: Without dead ends: 255 [2019-10-15 01:28:22,957 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:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-15 01:28:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-10-15 01:28:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-15 01:28:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2019-10-15 01:28:22,989 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 77 [2019-10-15 01:28:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,991 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2019-10-15 01:28:22,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2019-10-15 01:28:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:22,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,996 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] [2019-10-15 01:28:22,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1762934961, now seen corresponding path program 1 times [2019-10-15 01:28:22,996 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516063495] [2019-10-15 01:28:22,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,997 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,125 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:23,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516063495] [2019-10-15 01:28:23,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:23,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:23,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609510304] [2019-10-15 01:28:23,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:23,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:23,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:23,128 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand 5 states. [2019-10-15 01:28:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,479 INFO L93 Difference]: Finished difference Result 587 states and 751 transitions. [2019-10-15 01:28:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:23,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,483 INFO L225 Difference]: With dead ends: 587 [2019-10-15 01:28:23,483 INFO L226 Difference]: Without dead ends: 355 [2019-10-15 01:28:23,485 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:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-10-15 01:28:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2019-10-15 01:28:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-15 01:28:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-10-15 01:28:23,511 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 384 transitions. Word has length 77 [2019-10-15 01:28:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,511 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-10-15 01:28:23,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 384 transitions. [2019-10-15 01:28:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:23,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,513 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] [2019-10-15 01:28:23,513 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,514 INFO L82 PathProgramCache]: Analyzing trace with hash 160293073, now seen corresponding path program 1 times [2019-10-15 01:28:23,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373876271] [2019-10-15 01:28:23,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,568 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:23,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373876271] [2019-10-15 01:28:23,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:23,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:23,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34333871] [2019-10-15 01:28:23,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:23,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:23,571 INFO L87 Difference]: Start difference. First operand 313 states and 384 transitions. Second operand 5 states. [2019-10-15 01:28:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,813 INFO L93 Difference]: Finished difference Result 605 states and 746 transitions. [2019-10-15 01:28:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:23,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,818 INFO L225 Difference]: With dead ends: 605 [2019-10-15 01:28:23,818 INFO L226 Difference]: Without dead ends: 313 [2019-10-15 01:28:23,820 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:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-15 01:28:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-10-15 01:28:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-15 01:28:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 380 transitions. [2019-10-15 01:28:23,852 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 380 transitions. Word has length 77 [2019-10-15 01:28:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:23,852 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 380 transitions. [2019-10-15 01:28:23,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:23,852 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 380 transitions. [2019-10-15 01:28:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:23,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:23,854 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] [2019-10-15 01:28:23,854 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash 222332687, now seen corresponding path program 1 times [2019-10-15 01:28:23,855 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:23,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121115536] [2019-10-15 01:28:23,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:23,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:23,944 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:23,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121115536] [2019-10-15 01:28:23,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:23,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:23,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727714834] [2019-10-15 01:28:23,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:23,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:23,949 INFO L87 Difference]: Start difference. First operand 313 states and 380 transitions. Second operand 5 states. [2019-10-15 01:28:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,363 INFO L93 Difference]: Finished difference Result 757 states and 983 transitions. [2019-10-15 01:28:24,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:28:24,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,368 INFO L225 Difference]: With dead ends: 757 [2019-10-15 01:28:24,368 INFO L226 Difference]: Without dead ends: 464 [2019-10-15 01:28:24,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-15 01:28:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2019-10-15 01:28:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-15 01:28:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2019-10-15 01:28:24,404 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 77 [2019-10-15 01:28:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,404 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2019-10-15 01:28:24,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2019-10-15 01:28:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:24,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,406 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] [2019-10-15 01:28:24,406 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash -835288726, now seen corresponding path program 1 times [2019-10-15 01:28:24,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901602413] [2019-10-15 01:28:24,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,407 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,449 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:24,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901602413] [2019-10-15 01:28:24,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:24,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886845179] [2019-10-15 01:28:24,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:24,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:24,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:24,451 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 5 states. [2019-10-15 01:28:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,716 INFO L93 Difference]: Finished difference Result 727 states and 886 transitions. [2019-10-15 01:28:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:28:24,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 01:28:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,719 INFO L225 Difference]: With dead ends: 727 [2019-10-15 01:28:24,719 INFO L226 Difference]: Without dead ends: 363 [2019-10-15 01:28:24,721 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:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-15 01:28:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 333. [2019-10-15 01:28:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-10-15 01:28:24,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 392 transitions. [2019-10-15 01:28:24,744 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 392 transitions. Word has length 78 [2019-10-15 01:28:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,745 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 392 transitions. [2019-10-15 01:28:24,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:24,745 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 392 transitions. [2019-10-15 01:28:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:24,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,746 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] [2019-10-15 01:28:24,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,747 INFO L82 PathProgramCache]: Analyzing trace with hash 362881297, now seen corresponding path program 1 times [2019-10-15 01:28:24,747 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140452907] [2019-10-15 01:28:24,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,747 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,798 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:24,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140452907] [2019-10-15 01:28:24,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:24,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791037174] [2019-10-15 01:28:24,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:24,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:24,801 INFO L87 Difference]: Start difference. First operand 333 states and 392 transitions. Second operand 5 states. [2019-10-15 01:28:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,162 INFO L93 Difference]: Finished difference Result 737 states and 919 transitions. [2019-10-15 01:28:25,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:25,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-15 01:28:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,166 INFO L225 Difference]: With dead ends: 737 [2019-10-15 01:28:25,166 INFO L226 Difference]: Without dead ends: 425 [2019-10-15 01:28:25,167 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:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-10-15 01:28:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 364. [2019-10-15 01:28:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-10-15 01:28:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2019-10-15 01:28:25,195 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 77 [2019-10-15 01:28:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,196 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2019-10-15 01:28:25,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2019-10-15 01:28:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 01:28:25,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,197 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] [2019-10-15 01:28:25,197 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-10-15 01:28:25,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673692170] [2019-10-15 01:28:25,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,232 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:25,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673692170] [2019-10-15 01:28:25,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:25,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399373180] [2019-10-15 01:28:25,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:25,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:25,234 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 3 states. [2019-10-15 01:28:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,285 INFO L93 Difference]: Finished difference Result 1024 states and 1227 transitions. [2019-10-15 01:28:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:25,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-15 01:28:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,290 INFO L225 Difference]: With dead ends: 1024 [2019-10-15 01:28:25,290 INFO L226 Difference]: Without dead ends: 680 [2019-10-15 01:28:25,291 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:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-15 01:28:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2019-10-15 01:28:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-15 01:28:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 787 transitions. [2019-10-15 01:28:25,339 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 787 transitions. Word has length 77 [2019-10-15 01:28:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,340 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 787 transitions. [2019-10-15 01:28:25,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 787 transitions. [2019-10-15 01:28:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:28:25,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,343 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2019-10-15 01:28:25,344 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621340829] [2019-10-15 01:28:25,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,344 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:28:25,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621340829] [2019-10-15 01:28:25,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:25,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:25,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459829925] [2019-10-15 01:28:25,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:25,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:25,391 INFO L87 Difference]: Start difference. First operand 676 states and 787 transitions. Second operand 4 states. [2019-10-15 01:28:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:25,627 INFO L93 Difference]: Finished difference Result 1722 states and 2036 transitions. [2019-10-15 01:28:25,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:25,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-15 01:28:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:25,632 INFO L225 Difference]: With dead ends: 1722 [2019-10-15 01:28:25,633 INFO L226 Difference]: Without dead ends: 805 [2019-10-15 01:28:25,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-15 01:28:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-10-15 01:28:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-15 01:28:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 897 transitions. [2019-10-15 01:28:25,699 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 897 transitions. Word has length 121 [2019-10-15 01:28:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:25,700 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 897 transitions. [2019-10-15 01:28:25,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 897 transitions. [2019-10-15 01:28:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-15 01:28:25,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:25,707 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, 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] [2019-10-15 01:28:25,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-10-15 01:28:25,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:25,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520467769] [2019-10-15 01:28:25,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:25,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-15 01:28:25,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520467769] [2019-10-15 01:28:25,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944601082] [2019-10-15 01:28:25,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 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:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:25,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:28:25,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:28:26,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-15 01:28:26,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:28:26,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2019-10-15 01:28:26,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714322416] [2019-10-15 01:28:26,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:26,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:26,329 INFO L87 Difference]: Start difference. First operand 797 states and 897 transitions. Second operand 3 states. [2019-10-15 01:28:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:26,446 INFO L93 Difference]: Finished difference Result 1888 states and 2136 transitions. [2019-10-15 01:28:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:26,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-15 01:28:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:26,453 INFO L225 Difference]: With dead ends: 1888 [2019-10-15 01:28:26,453 INFO L226 Difference]: Without dead ends: 563 [2019-10-15 01:28:26,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-15 01:28:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-15 01:28:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-15 01:28:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 621 transitions. [2019-10-15 01:28:26,509 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 621 transitions. Word has length 176 [2019-10-15 01:28:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:26,511 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 621 transitions. [2019-10-15 01:28:26,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 621 transitions. [2019-10-15 01:28:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-15 01:28:26,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:26,515 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, 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] [2019-10-15 01:28:26,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:26,728 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:26,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:26,728 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-10-15 01:28:26,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:26,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8325500] [2019-10-15 01:28:26,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:26,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-15 01:28:26,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8325500] [2019-10-15 01:28:26,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:26,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:26,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471790170] [2019-10-15 01:28:26,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:26,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:26,878 INFO L87 Difference]: Start difference. First operand 563 states and 621 transitions. Second operand 6 states. [2019-10-15 01:28:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:27,628 INFO L93 Difference]: Finished difference Result 709 states and 790 transitions. [2019-10-15 01:28:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:28:27,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-10-15 01:28:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:27,630 INFO L225 Difference]: With dead ends: 709 [2019-10-15 01:28:27,630 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:27,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:27,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-10-15 01:28:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:27,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:27,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:27,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:27,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:30,820 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-10-15 01:28:32,604 WARN L191 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 122 DAG size of output: 54 [2019-10-15 01:28:33,104 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-15 01:28:33,602 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:34,097 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:34,267 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-15 01:28:34,725 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:35,183 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:35,297 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-15 01:28:35,780 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:36,496 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2019-10-15 01:28:36,674 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-15 01:28:37,135 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:38,617 WARN L191 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 124 DAG size of output: 66 [2019-10-15 01:28:39,062 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-10-15 01:28:40,406 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 123 DAG size of output: 59 [2019-10-15 01:28:41,431 WARN L191 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-10-15 01:28:42,394 WARN L191 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-10-15 01:28:42,858 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:43,115 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-10-15 01:28:44,411 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-10-15 01:28:45,616 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2019-10-15 01:28:45,841 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-10-15 01:28:47,112 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-10-15 01:28:47,529 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-10-15 01:28:47,990 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:49,286 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-10-15 01:28:49,391 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-15 01:28:49,497 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-15 01:28:49,787 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-10-15 01:28:50,708 WARN L191 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2019-10-15 01:28:51,164 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-10-15 01:28:51,608 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-10-15 01:28:51,939 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-10-15 01:28:52,254 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-10-15 01:28:54,163 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-10-15 01:28:55,010 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-10-15 01:28:55,387 WARN L191 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-10-15 01:28:55,847 WARN L191 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2019-10-15 01:28:57,262 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 123 DAG size of output: 59 [2019-10-15 01:28:58,135 WARN L191 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 50 [2019-10-15 01:28:58,582 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-10-15 01:28:59,006 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-15 01:28:59,112 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50