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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:17,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:17,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:17,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:17,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:17,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:17,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:17,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:17,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:17,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:17,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:17,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:17,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:17,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:17,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:17,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:17,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:17,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:17,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:17,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:17,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:17,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:17,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:17,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:17,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:17,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:17,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:17,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:17,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:17,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:17,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:17,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:17,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:17,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:17,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:17,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:17,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:17,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:17,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:17,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:17,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:17,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:27:17,883 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:17,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:17,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:17,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:17,887 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:17,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:17,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:17,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:17,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:17,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:17,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:17,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:17,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:17,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:17,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:17,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:17,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:17,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:17,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:27:18,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:18,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:18,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:18,183 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:18,184 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:18,184 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-15 03:27:18,242 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d17cbc2/eb2702eb0fae46f4b9f100e02d5980b6/FLAGbf3992c9a [2019-10-15 03:27:18,737 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:18,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:18,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d17cbc2/eb2702eb0fae46f4b9f100e02d5980b6/FLAGbf3992c9a [2019-10-15 03:27:19,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10d17cbc2/eb2702eb0fae46f4b9f100e02d5980b6 [2019-10-15 03:27:19,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:19,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:19,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:19,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:19,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:19,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e394a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19, skipping insertion in model container [2019-10-15 03:27:19,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,078 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:19,129 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:19,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:19,510 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:19,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:19,617 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:19,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19 WrapperNode [2019-10-15 03:27:19,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:19,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:19,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:19,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:19,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... [2019-10-15 03:27:19,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:19,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:19,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:19,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:19,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:19,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:19,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:19,756 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-15 03:27:19,756 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-15 03:27:19,756 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-15 03:27:19,757 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-15 03:27:19,757 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-15 03:27:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-15 03:27:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-15 03:27:19,759 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-15 03:27:19,759 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-15 03:27:19,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:19,762 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:19,763 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-15 03:27:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-15 03:27:19,764 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-15 03:27:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-15 03:27:19,765 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-15 03:27:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:19,766 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-15 03:27:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-15 03:27:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-15 03:27:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-15 03:27:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:21,015 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:21,016 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:27:21,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:21 BoogieIcfgContainer [2019-10-15 03:27:21,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:21,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:21,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:21,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:21,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:19" (1/3) ... [2019-10-15 03:27:21,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195c456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:21, skipping insertion in model container [2019-10-15 03:27:21,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:19" (2/3) ... [2019-10-15 03:27:21,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195c456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:21, skipping insertion in model container [2019-10-15 03:27:21,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:21" (3/3) ... [2019-10-15 03:27:21,027 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-10-15 03:27:21,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:21,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:21,055 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:21,091 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:21,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:21,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:21,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:21,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:21,092 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:21,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:21,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:21,128 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-15 03:27:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:27:21,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:21,142 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] [2019-10-15 03:27:21,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 758147934, now seen corresponding path program 1 times [2019-10-15 03:27:21,163 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:21,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959010618] [2019-10-15 03:27:21,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:21,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959010618] [2019-10-15 03:27:21,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:21,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:21,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224600475] [2019-10-15 03:27:21,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:21,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:21,528 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-10-15 03:27:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:21,684 INFO L93 Difference]: Finished difference Result 320 states and 504 transitions. [2019-10-15 03:27:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:21,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:27:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:21,700 INFO L225 Difference]: With dead ends: 320 [2019-10-15 03:27:21,700 INFO L226 Difference]: Without dead ends: 164 [2019-10-15 03:27:21,707 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-15 03:27:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-15 03:27:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-15 03:27:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-15 03:27:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2019-10-15 03:27:21,775 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 20 [2019-10-15 03:27:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:21,775 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2019-10-15 03:27:21,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2019-10-15 03:27:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:27:21,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:21,778 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-15 03:27:21,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 658096871, now seen corresponding path program 1 times [2019-10-15 03:27:21,779 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:21,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594967044] [2019-10-15 03:27:21,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:21,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594967044] [2019-10-15 03:27:21,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:21,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:21,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063182255] [2019-10-15 03:27:21,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:21,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:21,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:21,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:21,873 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand 4 states. [2019-10-15 03:27:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:21,945 INFO L93 Difference]: Finished difference Result 330 states and 478 transitions. [2019-10-15 03:27:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:21,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:27:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:21,952 INFO L225 Difference]: With dead ends: 330 [2019-10-15 03:27:21,952 INFO L226 Difference]: Without dead ends: 176 [2019-10-15 03:27:21,958 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-15 03:27:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-15 03:27:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-10-15 03:27:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-15 03:27:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2019-10-15 03:27:21,981 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 21 [2019-10-15 03:27:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:21,982 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2019-10-15 03:27:21,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2019-10-15 03:27:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:27:21,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:21,984 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] [2019-10-15 03:27:21,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1614839382, now seen corresponding path program 1 times [2019-10-15 03:27:21,985 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:21,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878574004] [2019-10-15 03:27:21,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:21,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,070 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-15 03:27:22,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878574004] [2019-10-15 03:27:22,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:22,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451535985] [2019-10-15 03:27:22,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:22,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:22,072 INFO L87 Difference]: Start difference. First operand 174 states and 246 transitions. Second operand 3 states. [2019-10-15 03:27:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,108 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2019-10-15 03:27:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:22,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:27:22,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,115 INFO L225 Difference]: With dead ends: 362 [2019-10-15 03:27:22,115 INFO L226 Difference]: Without dead ends: 203 [2019-10-15 03:27:22,117 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-15 03:27:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-15 03:27:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-10-15 03:27:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-15 03:27:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2019-10-15 03:27:22,153 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 28 [2019-10-15 03:27:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,153 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2019-10-15 03:27:22,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2019-10-15 03:27:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:27:22,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,156 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] [2019-10-15 03:27:22,156 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1162341358, now seen corresponding path program 1 times [2019-10-15 03:27:22,157 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835154429] [2019-10-15 03:27:22,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,255 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-15 03:27:22,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835154429] [2019-10-15 03:27:22,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:22,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125740847] [2019-10-15 03:27:22,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:22,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:22,258 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand 5 states. [2019-10-15 03:27:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,292 INFO L93 Difference]: Finished difference Result 340 states and 483 transitions. [2019-10-15 03:27:22,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:22,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-15 03:27:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,295 INFO L225 Difference]: With dead ends: 340 [2019-10-15 03:27:22,295 INFO L226 Difference]: Without dead ends: 184 [2019-10-15 03:27:22,296 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-15 03:27:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-15 03:27:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-10-15 03:27:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-15 03:27:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2019-10-15 03:27:22,311 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 36 [2019-10-15 03:27:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,311 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2019-10-15 03:27:22,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2019-10-15 03:27:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:27:22,313 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,314 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] [2019-10-15 03:27:22,314 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash 985709149, now seen corresponding path program 1 times [2019-10-15 03:27:22,315 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238792090] [2019-10-15 03:27:22,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:22,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238792090] [2019-10-15 03:27:22,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893800747] [2019-10-15 03:27:22,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,400 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand 4 states. [2019-10-15 03:27:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,417 INFO L93 Difference]: Finished difference Result 303 states and 425 transitions. [2019-10-15 03:27:22,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:22,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 03:27:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,420 INFO L225 Difference]: With dead ends: 303 [2019-10-15 03:27:22,420 INFO L226 Difference]: Without dead ends: 176 [2019-10-15 03:27:22,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-15 03:27:22,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-10-15 03:27:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-15 03:27:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 244 transitions. [2019-10-15 03:27:22,432 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 244 transitions. Word has length 37 [2019-10-15 03:27:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,432 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 244 transitions. [2019-10-15 03:27:22,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 244 transitions. [2019-10-15 03:27:22,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:27:22,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,434 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-15 03:27:22,434 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -562127975, now seen corresponding path program 1 times [2019-10-15 03:27:22,435 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180266145] [2019-10-15 03:27:22,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,498 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-15 03:27:22,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180266145] [2019-10-15 03:27:22,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994148821] [2019-10-15 03:27:22,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,506 INFO L87 Difference]: Start difference. First operand 176 states and 244 transitions. Second operand 4 states. [2019-10-15 03:27:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,567 INFO L93 Difference]: Finished difference Result 348 states and 492 transitions. [2019-10-15 03:27:22,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:22,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-15 03:27:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,571 INFO L225 Difference]: With dead ends: 348 [2019-10-15 03:27:22,571 INFO L226 Difference]: Without dead ends: 193 [2019-10-15 03:27:22,572 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-15 03:27:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-15 03:27:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-10-15 03:27:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-15 03:27:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2019-10-15 03:27:22,593 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 38 [2019-10-15 03:27:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,595 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2019-10-15 03:27:22,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2019-10-15 03:27:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:27:22,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,599 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] [2019-10-15 03:27:22,599 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2048456470, now seen corresponding path program 1 times [2019-10-15 03:27:22,600 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998402137] [2019-10-15 03:27:22,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,680 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-15 03:27:22,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998402137] [2019-10-15 03:27:22,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458144556] [2019-10-15 03:27:22,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,682 INFO L87 Difference]: Start difference. First operand 191 states and 262 transitions. Second operand 4 states. [2019-10-15 03:27:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,741 INFO L93 Difference]: Finished difference Result 366 states and 516 transitions. [2019-10-15 03:27:22,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:22,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-15 03:27:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,745 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:27:22,745 INFO L226 Difference]: Without dead ends: 198 [2019-10-15 03:27:22,746 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-15 03:27:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-15 03:27:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-15 03:27:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-15 03:27:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 266 transitions. [2019-10-15 03:27:22,767 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 266 transitions. Word has length 38 [2019-10-15 03:27:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,767 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 266 transitions. [2019-10-15 03:27:22,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 266 transitions. [2019-10-15 03:27:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:27:22,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,772 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] [2019-10-15 03:27:22,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash -905435297, now seen corresponding path program 1 times [2019-10-15 03:27:22,773 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875821616] [2019-10-15 03:27:22,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,848 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-15 03:27:22,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875821616] [2019-10-15 03:27:22,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:22,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160757381] [2019-10-15 03:27:22,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:22,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:22,851 INFO L87 Difference]: Start difference. First operand 196 states and 266 transitions. Second operand 5 states. [2019-10-15 03:27:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:22,876 INFO L93 Difference]: Finished difference Result 364 states and 500 transitions. [2019-10-15 03:27:22,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:22,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 03:27:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:22,879 INFO L225 Difference]: With dead ends: 364 [2019-10-15 03:27:22,879 INFO L226 Difference]: Without dead ends: 198 [2019-10-15 03:27:22,881 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-15 03:27:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-15 03:27:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-15 03:27:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-15 03:27:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 265 transitions. [2019-10-15 03:27:22,894 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 265 transitions. Word has length 55 [2019-10-15 03:27:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:22,894 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 265 transitions. [2019-10-15 03:27:22,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 265 transitions. [2019-10-15 03:27:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:27:22,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:22,896 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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-15 03:27:22,896 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1171722150, now seen corresponding path program 1 times [2019-10-15 03:27:22,897 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:22,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304439876] [2019-10-15 03:27:22,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,898 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:22,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:27:22,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304439876] [2019-10-15 03:27:22,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:22,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:22,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599658724] [2019-10-15 03:27:22,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:22,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:22,974 INFO L87 Difference]: Start difference. First operand 196 states and 265 transitions. Second operand 4 states. [2019-10-15 03:27:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,024 INFO L93 Difference]: Finished difference Result 376 states and 520 transitions. [2019-10-15 03:27:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:23,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-15 03:27:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,033 INFO L225 Difference]: With dead ends: 376 [2019-10-15 03:27:23,033 INFO L226 Difference]: Without dead ends: 215 [2019-10-15 03:27:23,035 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-15 03:27:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-15 03:27:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-15 03:27:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-15 03:27:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 285 transitions. [2019-10-15 03:27:23,052 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 285 transitions. Word has length 57 [2019-10-15 03:27:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,053 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 285 transitions. [2019-10-15 03:27:23,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 285 transitions. [2019-10-15 03:27:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:23,056 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,056 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-15 03:27:23,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -812439080, now seen corresponding path program 1 times [2019-10-15 03:27:23,057 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630588746] [2019-10-15 03:27:23,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:27:23,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630588746] [2019-10-15 03:27:23,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:23,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505344491] [2019-10-15 03:27:23,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:23,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:23,131 INFO L87 Difference]: Start difference. First operand 213 states and 285 transitions. Second operand 4 states. [2019-10-15 03:27:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,194 INFO L93 Difference]: Finished difference Result 387 states and 532 transitions. [2019-10-15 03:27:23,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:23,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-15 03:27:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,196 INFO L225 Difference]: With dead ends: 387 [2019-10-15 03:27:23,197 INFO L226 Difference]: Without dead ends: 211 [2019-10-15 03:27:23,198 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-15 03:27:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-15 03:27:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-10-15 03:27:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 03:27:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2019-10-15 03:27:23,209 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 58 [2019-10-15 03:27:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2019-10-15 03:27:23,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2019-10-15 03:27:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:23,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,211 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1] [2019-10-15 03:27:23,211 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1928367096, now seen corresponding path program 1 times [2019-10-15 03:27:23,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845582255] [2019-10-15 03:27:23,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 03:27:23,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845582255] [2019-10-15 03:27:23,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:23,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083178440] [2019-10-15 03:27:23,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:23,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:23,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:23,267 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand 5 states. [2019-10-15 03:27:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,287 INFO L93 Difference]: Finished difference Result 379 states and 508 transitions. [2019-10-15 03:27:23,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:23,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-15 03:27:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,290 INFO L225 Difference]: With dead ends: 379 [2019-10-15 03:27:23,290 INFO L226 Difference]: Without dead ends: 213 [2019-10-15 03:27:23,291 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-15 03:27:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-15 03:27:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-15 03:27:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-15 03:27:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2019-10-15 03:27:23,302 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 76 [2019-10-15 03:27:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,302 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2019-10-15 03:27:23,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2019-10-15 03:27:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:27:23,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,305 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-15 03:27:23,305 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1106817535, now seen corresponding path program 1 times [2019-10-15 03:27:23,306 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564625728] [2019-10-15 03:27:23,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,307 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-15 03:27:23,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564625728] [2019-10-15 03:27:23,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:23,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519320756] [2019-10-15 03:27:23,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:23,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:23,355 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 4 states. [2019-10-15 03:27:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,418 INFO L93 Difference]: Finished difference Result 368 states and 506 transitions. [2019-10-15 03:27:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:23,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-15 03:27:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,421 INFO L225 Difference]: With dead ends: 368 [2019-10-15 03:27:23,421 INFO L226 Difference]: Without dead ends: 209 [2019-10-15 03:27:23,422 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-15 03:27:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-15 03:27:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-10-15 03:27:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-15 03:27:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 274 transitions. [2019-10-15 03:27:23,432 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 274 transitions. Word has length 78 [2019-10-15 03:27:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,433 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 274 transitions. [2019-10-15 03:27:23,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 274 transitions. [2019-10-15 03:27:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:27:23,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,435 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:27:23,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1814640674, now seen corresponding path program 1 times [2019-10-15 03:27:23,435 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574676886] [2019-10-15 03:27:23,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-15 03:27:23,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574676886] [2019-10-15 03:27:23,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554281854] [2019-10-15 03:27:23,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:27:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:27:23,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:27:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-15 03:27:23,716 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:27:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-15 03:27:23,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [587011544] [2019-10-15 03:27:23,825 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-15 03:27:23,825 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:27:23,831 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:27:23,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:27:23,839 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:27:24,613 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-15 03:27:25,037 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-10-15 03:27:25,278 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-15 03:27:28,417 INFO L199 IcfgInterpreter]: Interpreting procedure gate1_each_pals_period with input of size 119 for LOIs [2019-10-15 03:27:28,478 INFO L199 IcfgInterpreter]: Interpreting procedure write_history_bool with input of size 119 for LOIs [2019-10-15 03:27:28,595 INFO L199 IcfgInterpreter]: Interpreting procedure assert with input of size 1 for LOIs [2019-10-15 03:27:28,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2019-10-15 03:27:28,643 INFO L199 IcfgInterpreter]: Interpreting procedure init with input of size 89 for LOIs [2019-10-15 03:27:34,195 INFO L199 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 113 for LOIs [2019-10-15 03:27:39,190 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:39,381 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:39,585 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:39,766 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:39,975 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:40,164 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:40,580 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:40,767 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:40,978 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:41,159 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:41,377 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:41,566 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:41,876 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:42,079 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:42,289 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:42,466 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:42,650 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:42,848 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:43,136 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:43,321 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:43,548 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:43,722 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:43,937 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:44,123 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:44,417 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:44,601 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:44,821 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:45,008 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:45,245 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:45,419 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:45,709 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:45,896 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:46,099 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:46,293 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:46,502 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:46,699 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:46,985 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:47,168 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:47,376 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:47,541 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:47,723 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:47,904 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,187 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,366 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,643 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:48,858 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:49,030 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:49,205 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:49,475 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:49,656 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:49,883 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:50,063 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:50,252 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:50,443 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:50,713 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:50,894 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:51,106 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:51,285 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:51,491 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:51,669 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:51,938 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,121 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,327 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,527 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:52,733 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,918 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:53,206 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:53,390 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:53,591 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:53,783 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:53,980 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:54,160 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,437 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,624 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,819 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:55,013 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:55,196 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62