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/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:25:19,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:25:19,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:25:19,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:25:19,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:25:19,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:25:19,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:25:19,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:25:19,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:25:19,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:25:19,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:25:19,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:25:19,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:25:19,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:25:19,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:25:19,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:25:19,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:25:19,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:25:19,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:25:19,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:25:19,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:25:19,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:25:19,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:25:19,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:25:19,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:25:19,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:25:19,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:25:19,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:25:19,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:25:19,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:25:19,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:25:19,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:25:19,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:25:19,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:25:19,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:25:19,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:25:19,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:25:19,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:25:19,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:25:19,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:25:19,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:25:19,824 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-13 21:25:19,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:25:19,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:25:19,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:25:19,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:25:19,839 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:25:19,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:25:19,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:25:19,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:25:19,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:25:19,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:25:19,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:25:19,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:25:19,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:25:19,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:25:19,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:25:19,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:25:19,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:25:19,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:25:19,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:25:19,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:25:19,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:25:19,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:19,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:25:19,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:25:19,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:25:19,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:25:19,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:25:19,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:25:19,844 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-13 21:25:20,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:25:20,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:25:20,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:25:20,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:25:20,121 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:25:20,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:20,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b79c3f7/76e309a0f313415c9571498b65026a84/FLAG655475ec3 [2019-10-13 21:25:20,746 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:25:20,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:20,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b79c3f7/76e309a0f313415c9571498b65026a84/FLAG655475ec3 [2019-10-13 21:25:21,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b79c3f7/76e309a0f313415c9571498b65026a84 [2019-10-13 21:25:21,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:25:21,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:25:21,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:21,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:25:21,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:25:21,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401bfe0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21, skipping insertion in model container [2019-10-13 21:25:21,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:25:21,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:25:21,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:21,531 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:25:21,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:21,643 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:25:21,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21 WrapperNode [2019-10-13 21:25:21,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:21,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:25:21,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:25:21,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:25:21,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (1/1) ... [2019-10-13 21:25:21,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:25:21,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:25:21,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:25:21,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:25:21,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (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-13 21:25:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:25:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:25:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-13 21:25:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-13 21:25:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-13 21:25:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-13 21:25:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-13 21:25:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-13 21:25:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:25:21,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:25:21,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:25:21,773 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-13 21:25:21,774 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:25:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:25:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:22,630 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:22,631 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:25:22,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:22 BoogieIcfgContainer [2019-10-13 21:25:22,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:22,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:22,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:22,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:22,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:25:21" (1/3) ... [2019-10-13 21:25:22,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b9b48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:22, skipping insertion in model container [2019-10-13 21:25:22,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:21" (2/3) ... [2019-10-13 21:25:22,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b9b48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:22, skipping insertion in model container [2019-10-13 21:25:22,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:22" (3/3) ... [2019-10-13 21:25:22,641 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:22,651 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:22,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:22,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:22,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:22,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:22,707 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:22,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:22,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:22,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:22,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:22,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-10-13 21:25:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:25:22,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:22,741 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] [2019-10-13 21:25:22,744 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:22,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:22,748 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-10-13 21:25:22,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:22,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359889457] [2019-10-13 21:25:22,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,040 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-13 21:25:23,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359889457] [2019-10-13 21:25:23,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:23,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749561452] [2019-10-13 21:25:23,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:23,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:23,066 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-10-13 21:25:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,331 INFO L93 Difference]: Finished difference Result 419 states and 679 transitions. [2019-10-13 21:25:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:23,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 21:25:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,352 INFO L225 Difference]: With dead ends: 419 [2019-10-13 21:25:23,353 INFO L226 Difference]: Without dead ends: 213 [2019-10-13 21:25:23,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-13 21:25:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-13 21:25:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-13 21:25:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-10-13 21:25:23,428 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-10-13 21:25:23,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,429 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-10-13 21:25:23,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-10-13 21:25:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:25:23,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,432 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] [2019-10-13 21:25:23,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-10-13 21:25:23,433 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88280333] [2019-10-13 21:25:23,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,551 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-13 21:25:23,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88280333] [2019-10-13 21:25:23,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:23,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577274760] [2019-10-13 21:25:23,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:23,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:23,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:23,555 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2019-10-13 21:25:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,628 INFO L93 Difference]: Finished difference Result 429 states and 645 transitions. [2019-10-13 21:25:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:23,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-13 21:25:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,633 INFO L225 Difference]: With dead ends: 429 [2019-10-13 21:25:23,633 INFO L226 Difference]: Without dead ends: 227 [2019-10-13 21:25:23,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-13 21:25:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-10-13 21:25:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-10-13 21:25:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-10-13 21:25:23,678 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-10-13 21:25:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,678 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-10-13 21:25:23,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-10-13 21:25:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 21:25:23,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,686 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:23,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-10-13 21:25:23,687 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136019475] [2019-10-13 21:25:23,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:23,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136019475] [2019-10-13 21:25:23,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:23,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171936229] [2019-10-13 21:25:23,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:23,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:23,794 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2019-10-13 21:25:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,837 INFO L93 Difference]: Finished difference Result 461 states and 691 transitions. [2019-10-13 21:25:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:23,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 21:25:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,846 INFO L225 Difference]: With dead ends: 461 [2019-10-13 21:25:23,846 INFO L226 Difference]: Without dead ends: 253 [2019-10-13 21:25:23,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-13 21:25:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-13 21:25:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-10-13 21:25:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-13 21:25:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-10-13 21:25:23,896 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-10-13 21:25:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,898 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-10-13 21:25:23,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-10-13 21:25:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:25:23,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,905 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:23,906 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-10-13 21:25:23,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630468800] [2019-10-13 21:25:23,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:24,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630468800] [2019-10-13 21:25:24,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:24,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681032392] [2019-10-13 21:25:24,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:24,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,025 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2019-10-13 21:25:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,063 INFO L93 Difference]: Finished difference Result 438 states and 649 transitions. [2019-10-13 21:25:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 21:25:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,067 INFO L225 Difference]: With dead ends: 438 [2019-10-13 21:25:24,067 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 21:25:24,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 21:25:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-10-13 21:25:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-13 21:25:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-10-13 21:25:24,084 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-10-13 21:25:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,084 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-10-13 21:25:24,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-10-13 21:25:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:25:24,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,086 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] [2019-10-13 21:25:24,087 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-10-13 21:25:24,087 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733727594] [2019-10-13 21:25:24,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,166 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-13 21:25:24,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733727594] [2019-10-13 21:25:24,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064725859] [2019-10-13 21:25:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,169 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2019-10-13 21:25:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,203 INFO L93 Difference]: Finished difference Result 399 states and 588 transitions. [2019-10-13 21:25:24,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:24,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-13 21:25:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,205 INFO L225 Difference]: With dead ends: 399 [2019-10-13 21:25:24,206 INFO L226 Difference]: Without dead ends: 226 [2019-10-13 21:25:24,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-13 21:25:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-10-13 21:25:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-13 21:25:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-10-13 21:25:24,223 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-10-13 21:25:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,225 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-10-13 21:25:24,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-10-13 21:25:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:25:24,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,227 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:24,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-10-13 21:25:24,228 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268370848] [2019-10-13 21:25:24,228 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:25:24,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268370848] [2019-10-13 21:25:24,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822645794] [2019-10-13 21:25:24,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,314 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2019-10-13 21:25:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,398 INFO L93 Difference]: Finished difference Result 448 states and 658 transitions. [2019-10-13 21:25:24,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-13 21:25:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,402 INFO L225 Difference]: With dead ends: 448 [2019-10-13 21:25:24,403 INFO L226 Difference]: Without dead ends: 245 [2019-10-13 21:25:24,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-13 21:25:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-10-13 21:25:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-13 21:25:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-10-13 21:25:24,419 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-10-13 21:25:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,419 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-10-13 21:25:24,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-10-13 21:25:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 21:25:24,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,421 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:25:24,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-10-13 21:25:24,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761291371] [2019-10-13 21:25:24,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:25:24,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761291371] [2019-10-13 21:25:24,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107093828] [2019-10-13 21:25:24,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,478 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2019-10-13 21:25:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,552 INFO L93 Difference]: Finished difference Result 468 states and 686 transitions. [2019-10-13 21:25:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-13 21:25:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,556 INFO L225 Difference]: With dead ends: 468 [2019-10-13 21:25:24,556 INFO L226 Difference]: Without dead ends: 251 [2019-10-13 21:25:24,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-13 21:25:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-13 21:25:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-13 21:25:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-10-13 21:25:24,576 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-10-13 21:25:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,577 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-10-13 21:25:24,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-10-13 21:25:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:25:24,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,579 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 21:25:24,579 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-10-13 21:25:24,595 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765111124] [2019-10-13 21:25:24,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:24,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765111124] [2019-10-13 21:25:24,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:24,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198624406] [2019-10-13 21:25:24,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:24,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,678 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2019-10-13 21:25:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,703 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-10-13 21:25:24,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 21:25:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,707 INFO L225 Difference]: With dead ends: 467 [2019-10-13 21:25:24,707 INFO L226 Difference]: Without dead ends: 251 [2019-10-13 21:25:24,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-13 21:25:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-10-13 21:25:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-13 21:25:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-10-13 21:25:24,721 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-10-13 21:25:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,722 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-10-13 21:25:24,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-10-13 21:25:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:25:24,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,723 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-13 21:25:24,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-10-13 21:25:24,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403372343] [2019-10-13 21:25:24,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:25:24,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403372343] [2019-10-13 21:25:24,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057003480] [2019-10-13 21:25:24,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,800 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2019-10-13 21:25:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,856 INFO L93 Difference]: Finished difference Result 481 states and 695 transitions. [2019-10-13 21:25:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:24,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-13 21:25:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,859 INFO L225 Difference]: With dead ends: 481 [2019-10-13 21:25:24,859 INFO L226 Difference]: Without dead ends: 270 [2019-10-13 21:25:24,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-10-13 21:25:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-10-13 21:25:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 21:25:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-10-13 21:25:24,874 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-10-13 21:25:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,875 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-10-13 21:25:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-10-13 21:25:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:25:24,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,876 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-13 21:25:24,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-10-13 21:25:24,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938355310] [2019-10-13 21:25:24,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:25:24,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938355310] [2019-10-13 21:25:24,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:24,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353527819] [2019-10-13 21:25:24,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:24,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:24,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:24,931 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2019-10-13 21:25:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,988 INFO L93 Difference]: Finished difference Result 488 states and 699 transitions. [2019-10-13 21:25:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:24,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-13 21:25:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,991 INFO L225 Difference]: With dead ends: 488 [2019-10-13 21:25:24,993 INFO L226 Difference]: Without dead ends: 261 [2019-10-13 21:25:24,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-13 21:25:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-10-13 21:25:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-13 21:25:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-10-13 21:25:25,012 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-10-13 21:25:25,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,013 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-10-13 21:25:25,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-10-13 21:25:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:25:25,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,014 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-13 21:25:25,014 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-10-13 21:25:25,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721857493] [2019-10-13 21:25:25,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 21:25:25,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721857493] [2019-10-13 21:25:25,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:25,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136396674] [2019-10-13 21:25:25,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:25,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:25,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,090 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2019-10-13 21:25:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,116 INFO L93 Difference]: Finished difference Result 475 states and 666 transitions. [2019-10-13 21:25:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:25,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-13 21:25:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,120 INFO L225 Difference]: With dead ends: 475 [2019-10-13 21:25:25,120 INFO L226 Difference]: Without dead ends: 263 [2019-10-13 21:25:25,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-13 21:25:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-10-13 21:25:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-10-13 21:25:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-10-13 21:25:25,132 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-10-13 21:25:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,134 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-10-13 21:25:25,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-10-13 21:25:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:25:25,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,138 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 21:25:25,139 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-10-13 21:25:25,139 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719485865] [2019-10-13 21:25:25,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-13 21:25:25,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719485865] [2019-10-13 21:25:25,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:25,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642220456] [2019-10-13 21:25:25,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:25,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:25,217 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2019-10-13 21:25:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,310 INFO L93 Difference]: Finished difference Result 464 states and 664 transitions. [2019-10-13 21:25:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:25,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:25:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,313 INFO L225 Difference]: With dead ends: 464 [2019-10-13 21:25:25,313 INFO L226 Difference]: Without dead ends: 259 [2019-10-13 21:25:25,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-13 21:25:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-13 21:25:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-13 21:25:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-10-13 21:25:25,323 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-10-13 21:25:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,324 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-10-13 21:25:25,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-10-13 21:25:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 21:25:25,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,329 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-13 21:25:25,329 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,330 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-10-13 21:25:25,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712982177] [2019-10-13 21:25:25,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-13 21:25:25,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712982177] [2019-10-13 21:25:25,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29278138] [2019-10-13 21:25:25,393 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-13 21:25:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:25:25,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 21:25:25,609 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-13 21:25:25,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [527653231] [2019-10-13 21:25:25,738 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 101 [2019-10-13 21:25:25,789 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:25:25,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:25:25,915 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:25:26,139 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:25:26,148 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-13 21:25:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,154 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:25:26,329 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-13 21:25:26,330 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:25:27,071 INFO L553 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-13 21:25:27,072 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:25:27,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:25:27,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 40 [2019-10-13 21:25:27,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867663352] [2019-10-13 21:25:27,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:25:27,074 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:27,075 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:25:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:25:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:25:27,076 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 35 states. [2019-10-13 21:25:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:38,310 INFO L93 Difference]: Finished difference Result 623 states and 867 transitions. [2019-10-13 21:25:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-13 21:25:38,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-13 21:25:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:38,313 INFO L225 Difference]: With dead ends: 623 [2019-10-13 21:25:38,313 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 21:25:38,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-13 21:25:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 21:25:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 307. [2019-10-13 21:25:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-13 21:25:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2019-10-13 21:25:38,334 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 100 [2019-10-13 21:25:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:38,335 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2019-10-13 21:25:38,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:25:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2019-10-13 21:25:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:25:38,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:38,337 INFO L380 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:38,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:38,543 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-10-13 21:25:38,545 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:38,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913218682] [2019-10-13 21:25:38,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:38,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913218682] [2019-10-13 21:25:38,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:38,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:38,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017276320] [2019-10-13 21:25:38,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:38,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:38,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:38,675 INFO L87 Difference]: Start difference. First operand 307 states and 405 transitions. Second operand 5 states. [2019-10-13 21:25:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:38,707 INFO L93 Difference]: Finished difference Result 479 states and 651 transitions. [2019-10-13 21:25:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:38,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-13 21:25:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:38,711 INFO L225 Difference]: With dead ends: 479 [2019-10-13 21:25:38,711 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 21:25:38,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 21:25:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-13 21:25:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-13 21:25:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions. [2019-10-13 21:25:38,727 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 144 [2019-10-13 21:25:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:38,728 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions. [2019-10-13 21:25:38,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions. [2019-10-13 21:25:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:25:38,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:38,732 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 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] [2019-10-13 21:25:38,732 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:38,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:38,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1981470506, now seen corresponding path program 1 times [2019-10-13 21:25:38,733 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:38,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576738521] [2019-10-13 21:25:38,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-13 21:25:38,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576738521] [2019-10-13 21:25:38,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273115483] [2019-10-13 21:25:38,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:25:39,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:39,118 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-13 21:25:39,241 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:25:39,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2019-10-13 21:25:39,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75558945] [2019-10-13 21:25:39,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:39,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:25:39,246 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand 3 states. [2019-10-13 21:25:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:39,273 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2019-10-13 21:25:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:39,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:25:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:39,277 INFO L225 Difference]: With dead ends: 507 [2019-10-13 21:25:39,277 INFO L226 Difference]: Without dead ends: 286 [2019-10-13 21:25:39,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:25:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-13 21:25:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-10-13 21:25:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-13 21:25:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 369 transitions. [2019-10-13 21:25:39,297 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 369 transitions. Word has length 153 [2019-10-13 21:25:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:39,298 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 369 transitions. [2019-10-13 21:25:39,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 369 transitions. [2019-10-13 21:25:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:25:39,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:39,301 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 21:25:39,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:39,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1947418555, now seen corresponding path program 1 times [2019-10-13 21:25:39,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:39,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475874087] [2019-10-13 21:25:39,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:25:39,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475874087] [2019-10-13 21:25:39,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:39,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:39,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813176537] [2019-10-13 21:25:39,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:39,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:39,607 INFO L87 Difference]: Start difference. First operand 286 states and 369 transitions. Second operand 4 states. [2019-10-13 21:25:39,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:39,637 INFO L93 Difference]: Finished difference Result 457 states and 617 transitions. [2019-10-13 21:25:39,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:39,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-13 21:25:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:39,642 INFO L225 Difference]: With dead ends: 457 [2019-10-13 21:25:39,642 INFO L226 Difference]: Without dead ends: 292 [2019-10-13 21:25:39,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-13 21:25:39,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2019-10-13 21:25:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-13 21:25:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 372 transitions. [2019-10-13 21:25:39,656 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 372 transitions. Word has length 161 [2019-10-13 21:25:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:39,656 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 372 transitions. [2019-10-13 21:25:39,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 372 transitions. [2019-10-13 21:25:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-13 21:25:39,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:39,661 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 21:25:39,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash -243298260, now seen corresponding path program 1 times [2019-10-13 21:25:39,664 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:39,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505125290] [2019-10-13 21:25:39,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-13 21:25:39,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505125290] [2019-10-13 21:25:39,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:39,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:39,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575038858] [2019-10-13 21:25:39,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:39,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:39,758 INFO L87 Difference]: Start difference. First operand 290 states and 372 transitions. Second operand 4 states. [2019-10-13 21:25:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:39,789 INFO L93 Difference]: Finished difference Result 466 states and 624 transitions. [2019-10-13 21:25:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:39,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-13 21:25:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:39,792 INFO L225 Difference]: With dead ends: 466 [2019-10-13 21:25:39,792 INFO L226 Difference]: Without dead ends: 297 [2019-10-13 21:25:39,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-13 21:25:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-10-13 21:25:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-13 21:25:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 376 transitions. [2019-10-13 21:25:39,805 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 376 transitions. Word has length 173 [2019-10-13 21:25:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:39,805 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 376 transitions. [2019-10-13 21:25:39,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 376 transitions. [2019-10-13 21:25:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-13 21:25:39,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:39,809 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:39,809 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652604, now seen corresponding path program 1 times [2019-10-13 21:25:39,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:39,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969185121] [2019-10-13 21:25:39,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-13 21:25:39,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969185121] [2019-10-13 21:25:39,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:39,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:39,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591292399] [2019-10-13 21:25:39,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:39,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:39,892 INFO L87 Difference]: Start difference. First operand 295 states and 376 transitions. Second operand 4 states. [2019-10-13 21:25:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:39,923 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2019-10-13 21:25:39,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:39,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-13 21:25:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:39,926 INFO L225 Difference]: With dead ends: 468 [2019-10-13 21:25:39,926 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 21:25:39,927 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 21:25:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-10-13 21:25:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-13 21:25:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 371 transitions. [2019-10-13 21:25:39,938 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 371 transitions. Word has length 186 [2019-10-13 21:25:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:39,939 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 371 transitions. [2019-10-13 21:25:39,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 371 transitions. [2019-10-13 21:25:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-13 21:25:39,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:39,942 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:39,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash 507025156, now seen corresponding path program 1 times [2019-10-13 21:25:39,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:39,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382879801] [2019-10-13 21:25:39,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-13 21:25:40,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382879801] [2019-10-13 21:25:40,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:40,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:40,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793737377] [2019-10-13 21:25:40,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:40,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:40,034 INFO L87 Difference]: Start difference. First operand 294 states and 371 transitions. Second operand 4 states. [2019-10-13 21:25:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:40,054 INFO L93 Difference]: Finished difference Result 466 states and 612 transitions. [2019-10-13 21:25:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:40,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-13 21:25:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:40,057 INFO L225 Difference]: With dead ends: 466 [2019-10-13 21:25:40,057 INFO L226 Difference]: Without dead ends: 293 [2019-10-13 21:25:40,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-13 21:25:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2019-10-13 21:25:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-13 21:25:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2019-10-13 21:25:40,069 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 199 [2019-10-13 21:25:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:40,070 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2019-10-13 21:25:40,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2019-10-13 21:25:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-13 21:25:40,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:40,073 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:40,073 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1935753462, now seen corresponding path program 1 times [2019-10-13 21:25:40,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:40,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067267651] [2019-10-13 21:25:40,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-13 21:25:40,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067267651] [2019-10-13 21:25:40,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:40,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:40,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169615862] [2019-10-13 21:25:40,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:40,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:40,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:40,159 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand 4 states. [2019-10-13 21:25:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:40,493 INFO L93 Difference]: Finished difference Result 786 states and 1048 transitions. [2019-10-13 21:25:40,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:40,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-13 21:25:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:40,503 INFO L225 Difference]: With dead ends: 786 [2019-10-13 21:25:40,503 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:25:40,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:25:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 476. [2019-10-13 21:25:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-13 21:25:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 628 transitions. [2019-10-13 21:25:40,530 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 628 transitions. Word has length 201 [2019-10-13 21:25:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:40,531 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 628 transitions. [2019-10-13 21:25:40,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:40,531 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 628 transitions. [2019-10-13 21:25:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-13 21:25:40,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:40,537 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:40,538 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash -833946183, now seen corresponding path program 1 times [2019-10-13 21:25:40,538 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:40,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350491316] [2019-10-13 21:25:40,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:40,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350491316] [2019-10-13 21:25:40,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:40,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:40,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695036841] [2019-10-13 21:25:40,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:40,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:40,672 INFO L87 Difference]: Start difference. First operand 476 states and 628 transitions. Second operand 4 states. [2019-10-13 21:25:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:40,892 INFO L93 Difference]: Finished difference Result 1175 states and 1615 transitions. [2019-10-13 21:25:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:40,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-13 21:25:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:40,899 INFO L225 Difference]: With dead ends: 1175 [2019-10-13 21:25:40,899 INFO L226 Difference]: Without dead ends: 820 [2019-10-13 21:25:40,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-10-13 21:25:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 805. [2019-10-13 21:25:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-13 21:25:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1084 transitions. [2019-10-13 21:25:40,950 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1084 transitions. Word has length 236 [2019-10-13 21:25:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:40,951 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1084 transitions. [2019-10-13 21:25:40,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1084 transitions. [2019-10-13 21:25:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-13 21:25:40,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:40,955 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:40,956 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -758669803, now seen corresponding path program 1 times [2019-10-13 21:25:40,956 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:40,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158222625] [2019-10-13 21:25:40,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:40,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:41,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158222625] [2019-10-13 21:25:41,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105729042] [2019-10-13 21:25:41,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,074 INFO L87 Difference]: Start difference. First operand 805 states and 1084 transitions. Second operand 4 states. [2019-10-13 21:25:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:41,394 INFO L93 Difference]: Finished difference Result 2153 states and 2978 transitions. [2019-10-13 21:25:41,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:41,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-13 21:25:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:41,409 INFO L225 Difference]: With dead ends: 2153 [2019-10-13 21:25:41,410 INFO L226 Difference]: Without dead ends: 1475 [2019-10-13 21:25:41,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2019-10-13 21:25:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1112. [2019-10-13 21:25:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-10-13 21:25:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1512 transitions. [2019-10-13 21:25:41,528 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1512 transitions. Word has length 237 [2019-10-13 21:25:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:41,531 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 1512 transitions. [2019-10-13 21:25:41,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1512 transitions. [2019-10-13 21:25:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-13 21:25:41,539 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:41,540 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:41,540 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576620, now seen corresponding path program 1 times [2019-10-13 21:25:41,541 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:41,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458918770] [2019-10-13 21:25:41,541 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:41,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-13 21:25:41,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458918770] [2019-10-13 21:25:41,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:41,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:41,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79936493] [2019-10-13 21:25:41,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:41,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:41,746 INFO L87 Difference]: Start difference. First operand 1112 states and 1512 transitions. Second operand 4 states. [2019-10-13 21:25:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:42,014 INFO L93 Difference]: Finished difference Result 3101 states and 4301 transitions. [2019-10-13 21:25:42,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:42,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-13 21:25:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:42,028 INFO L225 Difference]: With dead ends: 3101 [2019-10-13 21:25:42,028 INFO L226 Difference]: Without dead ends: 2116 [2019-10-13 21:25:42,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-10-13 21:25:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1402. [2019-10-13 21:25:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-10-13 21:25:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1918 transitions. [2019-10-13 21:25:42,120 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1918 transitions. Word has length 238 [2019-10-13 21:25:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:42,120 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 1918 transitions. [2019-10-13 21:25:42,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1918 transitions. [2019-10-13 21:25:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-13 21:25:42,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:42,127 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:25:42,127 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash 163407378, now seen corresponding path program 1 times [2019-10-13 21:25:42,128 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:42,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912660140] [2019-10-13 21:25:42,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:42,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-13 21:25:42,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912660140] [2019-10-13 21:25:42,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819170961] [2019-10-13 21:25:42,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:25:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:42,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:25:42,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:25:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 96 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-13 21:25:42,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:25:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-10-13 21:25:42,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [856394368] [2019-10-13 21:25:42,818 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 239 [2019-10-13 21:25:42,829 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:25:42,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:25:42,848 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-13 21:25:43,058 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 21:25:43,060 INFO L272 AbstractInterpreter]: Visited 123 different actions 339 times. Merged at 21 different actions 69 times. Never widened. Performed 1694 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1694 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 4 fixpoints after 2 different actions. Largest state had 90 variables. [2019-10-13 21:25:43,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:43,061 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 21:25:43,371 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.41% of their original sizes. [2019-10-13 21:25:43,371 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 21:25:46,677 INFO L553 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-13 21:25:46,678 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 21:25:46,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:25:46,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [7, 5, 5] total 84 [2019-10-13 21:25:46,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734880300] [2019-10-13 21:25:46,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-13 21:25:46,680 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:46,680 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 21:25:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-13 21:25:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=5304, Unknown=0, NotChecked=0, Total=5700 [2019-10-13 21:25:46,683 INFO L87 Difference]: Start difference. First operand 1402 states and 1918 transitions. Second operand 76 states.