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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:27:19,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:27:19,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:27:19,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:27:19,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:27:19,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:27:19,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:27:19,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:27:19,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:27:19,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:27:19,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:27:19,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:27:19,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:27:19,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:27:19,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:27:19,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:27:19,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:27:19,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:27:19,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:27:19,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:27:19,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:27:19,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:27:19,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:27:19,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:27:19,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:27:19,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:27:19,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:27:19,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:27:19,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:27:19,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:27:19,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:27:19,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:27:19,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:27:19,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:27:19,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:27:19,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:27:19,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:27:19,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:27:19,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:27:19,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:27:19,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:27:19,854 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:19,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:27:19,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:27:19,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:27:19,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:27:19,870 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:27:19,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:27:19,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:27:19,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:27:19,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:27:19,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:27:19,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:27:19,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:27:19,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:27:19,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:27:19,872 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:27:19,872 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:27:19,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:27:19,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:27:19,873 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:27:19,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:27:19,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:27:19,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:19,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:27:19,874 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:27:19,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:27:19,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:27:19,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:27:19,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:27:19,875 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:20,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:20,169 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:20,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:20,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:20,174 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:20,175 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.UNBOUNDED.pals.c [2019-10-15 03:27:20,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7525b60/2b17d42cf9cb458b94681ce36df85b00/FLAG81378cba1 [2019-10-15 03:27:20,808 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:20,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:20,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7525b60/2b17d42cf9cb458b94681ce36df85b00/FLAG81378cba1 [2019-10-15 03:27:21,080 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7525b60/2b17d42cf9cb458b94681ce36df85b00 [2019-10-15 03:27:21,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:21,094 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:21,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:21,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:21,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:21,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:21" (1/1) ... [2019-10-15 03:27:21,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f2c82e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:21, skipping insertion in model container [2019-10-15 03:27:21,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:21" (1/1) ... [2019-10-15 03:27:21,114 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:21,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:21,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:21,550 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:21,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:21,647 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:21,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:21 WrapperNode [2019-10-15 03:27:21,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:21,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:21,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:21,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:21,662 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:21" (1/1) ... [2019-10-15 03:27:21,662 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:21" (1/1) ... [2019-10-15 03:27:21,674 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:21" (1/1) ... [2019-10-15 03:27:21,674 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:21" (1/1) ... [2019-10-15 03:27:21,689 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:21" (1/1) ... [2019-10-15 03:27:21,701 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:21" (1/1) ... [2019-10-15 03:27:21,705 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:21" (1/1) ... [2019-10-15 03:27:21,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:21,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:21,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:21,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:21,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-15 03:27:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-15 03:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-15 03:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-15 03:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-15 03:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-15 03:27:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-15 03:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-15 03:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-15 03:27:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-15 03:27:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:23,027 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:23,027 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 03:27:23,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:23 BoogieIcfgContainer [2019-10-15 03:27:23,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:23,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:23,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:23,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:23,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:21" (1/3) ... [2019-10-15 03:27:23,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e17adb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:23, skipping insertion in model container [2019-10-15 03:27:23,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:21" (2/3) ... [2019-10-15 03:27:23,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e17adb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:23, skipping insertion in model container [2019-10-15 03:27:23,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:23" (3/3) ... [2019-10-15 03:27:23,037 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-15 03:27:23,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:23,055 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:27:23,066 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:27:23,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:23,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:23,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:23,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:23,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:23,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:23,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:23,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-10-15 03:27:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:27:23,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,133 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:23,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2046485733, now seen corresponding path program 1 times [2019-10-15 03:27:23,152 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041759274] [2019-10-15 03:27:23,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,442 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:23,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041759274] [2019-10-15 03:27:23,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:23,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241274273] [2019-10-15 03:27:23,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:23,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:23,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:23,467 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-10-15 03:27:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,618 INFO L93 Difference]: Finished difference Result 315 states and 500 transitions. [2019-10-15 03:27:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:23,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:27:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,643 INFO L225 Difference]: With dead ends: 315 [2019-10-15 03:27:23,643 INFO L226 Difference]: Without dead ends: 163 [2019-10-15 03:27:23,656 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,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-15 03:27:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-15 03:27:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-15 03:27:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2019-10-15 03:27:23,760 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 20 [2019-10-15 03:27:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,761 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2019-10-15 03:27:23,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2019-10-15 03:27:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:27:23,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,763 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:23,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1469294552, now seen corresponding path program 1 times [2019-10-15 03:27:23,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967260084] [2019-10-15 03:27:23,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:23,864 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:23,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967260084] [2019-10-15 03:27:23,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:23,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:23,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224013984] [2019-10-15 03:27:23,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:23,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:23,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:23,870 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 4 states. [2019-10-15 03:27:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:23,952 INFO L93 Difference]: Finished difference Result 328 states and 476 transitions. [2019-10-15 03:27:23,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:23,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:27:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:23,956 INFO L225 Difference]: With dead ends: 328 [2019-10-15 03:27:23,956 INFO L226 Difference]: Without dead ends: 175 [2019-10-15 03:27:23,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:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-15 03:27:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-10-15 03:27:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-15 03:27:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 245 transitions. [2019-10-15 03:27:23,976 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 245 transitions. Word has length 21 [2019-10-15 03:27:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:23,977 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 245 transitions. [2019-10-15 03:27:23,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 245 transitions. [2019-10-15 03:27:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:27:23,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:23,982 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:23,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:23,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:23,983 INFO L82 PathProgramCache]: Analyzing trace with hash -16432824, now seen corresponding path program 1 times [2019-10-15 03:27:23,984 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:23,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638517820] [2019-10-15 03:27:23,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:23,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,062 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:24,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638517820] [2019-10-15 03:27:24,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:24,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932586015] [2019-10-15 03:27:24,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:24,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:24,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:24,065 INFO L87 Difference]: Start difference. First operand 173 states and 245 transitions. Second operand 3 states. [2019-10-15 03:27:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,106 INFO L93 Difference]: Finished difference Result 360 states and 522 transitions. [2019-10-15 03:27:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:24,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:27:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,115 INFO L225 Difference]: With dead ends: 360 [2019-10-15 03:27:24,115 INFO L226 Difference]: Without dead ends: 202 [2019-10-15 03:27:24,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:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-15 03:27:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2019-10-15 03:27:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 03:27:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 247 transitions. [2019-10-15 03:27:24,151 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 247 transitions. Word has length 28 [2019-10-15 03:27:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,152 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 247 transitions. [2019-10-15 03:27:24,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 247 transitions. [2019-10-15 03:27:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:27:24,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,154 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:24,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1543063508, now seen corresponding path program 1 times [2019-10-15 03:27:24,157 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636903739] [2019-10-15 03:27:24,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,232 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:24,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636903739] [2019-10-15 03:27:24,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:24,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104780836] [2019-10-15 03:27:24,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:24,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:24,235 INFO L87 Difference]: Start difference. First operand 175 states and 247 transitions. Second operand 5 states. [2019-10-15 03:27:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,269 INFO L93 Difference]: Finished difference Result 338 states and 481 transitions. [2019-10-15 03:27:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:24,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-10-15 03:27:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,272 INFO L225 Difference]: With dead ends: 338 [2019-10-15 03:27:24,272 INFO L226 Difference]: Without dead ends: 183 [2019-10-15 03:27:24,273 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:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-15 03:27:24,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2019-10-15 03:27:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-15 03:27:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2019-10-15 03:27:24,292 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 36 [2019-10-15 03:27:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,293 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2019-10-15 03:27:24,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2019-10-15 03:27:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:27:24,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,295 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:24,295 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1623813277, now seen corresponding path program 1 times [2019-10-15 03:27:24,296 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328939268] [2019-10-15 03:27:24,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,381 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:24,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328939268] [2019-10-15 03:27:24,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650667658] [2019-10-15 03:27:24,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,385 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand 4 states. [2019-10-15 03:27:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,409 INFO L93 Difference]: Finished difference Result 301 states and 423 transitions. [2019-10-15 03:27:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:24,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 03:27:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,412 INFO L225 Difference]: With dead ends: 301 [2019-10-15 03:27:24,412 INFO L226 Difference]: Without dead ends: 175 [2019-10-15 03:27:24,413 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:24,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-15 03:27:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-10-15 03:27:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-15 03:27:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 243 transitions. [2019-10-15 03:27:24,426 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 243 transitions. Word has length 37 [2019-10-15 03:27:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,427 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 243 transitions. [2019-10-15 03:27:24,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 243 transitions. [2019-10-15 03:27:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:27:24,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,429 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:24,429 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1513406132, now seen corresponding path program 1 times [2019-10-15 03:27:24,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295069298] [2019-10-15 03:27:24,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,544 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:24,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295069298] [2019-10-15 03:27:24,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050214367] [2019-10-15 03:27:24,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,546 INFO L87 Difference]: Start difference. First operand 175 states and 243 transitions. Second operand 4 states. [2019-10-15 03:27:24,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,608 INFO L93 Difference]: Finished difference Result 346 states and 490 transitions. [2019-10-15 03:27:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:24,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-15 03:27:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,611 INFO L225 Difference]: With dead ends: 346 [2019-10-15 03:27:24,611 INFO L226 Difference]: Without dead ends: 192 [2019-10-15 03:27:24,612 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:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-15 03:27:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2019-10-15 03:27:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-10-15 03:27:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 261 transitions. [2019-10-15 03:27:24,623 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 261 transitions. Word has length 38 [2019-10-15 03:27:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,624 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 261 transitions. [2019-10-15 03:27:24,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 261 transitions. [2019-10-15 03:27:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:27:24,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,625 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:24,626 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1572931515, now seen corresponding path program 1 times [2019-10-15 03:27:24,626 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739562356] [2019-10-15 03:27:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,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:24,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739562356] [2019-10-15 03:27:24,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751667368] [2019-10-15 03:27:24,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,683 INFO L87 Difference]: Start difference. First operand 190 states and 261 transitions. Second operand 4 states. [2019-10-15 03:27:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,739 INFO L93 Difference]: Finished difference Result 364 states and 514 transitions. [2019-10-15 03:27:24,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:24,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-15 03:27:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,743 INFO L225 Difference]: With dead ends: 364 [2019-10-15 03:27:24,743 INFO L226 Difference]: Without dead ends: 197 [2019-10-15 03:27:24,744 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:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-15 03:27:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-15 03:27:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 03:27:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-10-15 03:27:24,763 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 38 [2019-10-15 03:27:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,764 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-10-15 03:27:24,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-10-15 03:27:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:27:24,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,767 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:24,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -523919551, now seen corresponding path program 1 times [2019-10-15 03:27:24,768 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297121233] [2019-10-15 03:27:24,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,858 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:24,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297121233] [2019-10-15 03:27:24,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:24,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204389166] [2019-10-15 03:27:24,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:24,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:24,862 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-10-15 03:27:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:24,886 INFO L93 Difference]: Finished difference Result 362 states and 498 transitions. [2019-10-15 03:27:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:24,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 03:27:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:24,889 INFO L225 Difference]: With dead ends: 362 [2019-10-15 03:27:24,889 INFO L226 Difference]: Without dead ends: 197 [2019-10-15 03:27:24,890 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:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-15 03:27:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-15 03:27:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-15 03:27:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-10-15 03:27:24,903 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 55 [2019-10-15 03:27:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:24,904 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-10-15 03:27:24,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-10-15 03:27:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:27:24,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:24,905 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:24,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1318466697, now seen corresponding path program 1 times [2019-10-15 03:27:24,906 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:24,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157338792] [2019-10-15 03:27:24,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:24,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:24,973 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:24,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157338792] [2019-10-15 03:27:24,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:24,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:24,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514157438] [2019-10-15 03:27:24,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:24,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:24,978 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 4 states. [2019-10-15 03:27:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,028 INFO L93 Difference]: Finished difference Result 374 states and 518 transitions. [2019-10-15 03:27:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:25,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-10-15 03:27:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,035 INFO L225 Difference]: With dead ends: 374 [2019-10-15 03:27:25,035 INFO L226 Difference]: Without dead ends: 214 [2019-10-15 03:27:25,036 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:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-15 03:27:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-10-15 03:27:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-15 03:27:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2019-10-15 03:27:25,053 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 57 [2019-10-15 03:27:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,053 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2019-10-15 03:27:25,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2019-10-15 03:27:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:27:25,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,055 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:25,055 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1302104397, now seen corresponding path program 1 times [2019-10-15 03:27:25,056 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522570002] [2019-10-15 03:27:25,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,057 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,138 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:25,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522570002] [2019-10-15 03:27:25,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:25,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752611378] [2019-10-15 03:27:25,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:25,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:25,141 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand 4 states. [2019-10-15 03:27:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,191 INFO L93 Difference]: Finished difference Result 385 states and 530 transitions. [2019-10-15 03:27:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:25,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-10-15 03:27:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,194 INFO L225 Difference]: With dead ends: 385 [2019-10-15 03:27:25,194 INFO L226 Difference]: Without dead ends: 210 [2019-10-15 03:27:25,195 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:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-10-15 03:27:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-10-15 03:27:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-15 03:27:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 278 transitions. [2019-10-15 03:27:25,209 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 278 transitions. Word has length 58 [2019-10-15 03:27:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,210 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 278 transitions. [2019-10-15 03:27:25,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 278 transitions. [2019-10-15 03:27:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:27:25,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,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:25,211 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1371108976, now seen corresponding path program 1 times [2019-10-15 03:27:25,212 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818843200] [2019-10-15 03:27:25,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,213 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,281 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:25,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818843200] [2019-10-15 03:27:25,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:25,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452009640] [2019-10-15 03:27:25,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:25,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:25,284 INFO L87 Difference]: Start difference. First operand 210 states and 278 transitions. Second operand 5 states. [2019-10-15 03:27:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,303 INFO L93 Difference]: Finished difference Result 377 states and 506 transitions. [2019-10-15 03:27:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:25,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-15 03:27:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,323 INFO L225 Difference]: With dead ends: 377 [2019-10-15 03:27:25,323 INFO L226 Difference]: Without dead ends: 212 [2019-10-15 03:27:25,324 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:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-15 03:27:25,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-15 03:27:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-15 03:27:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-10-15 03:27:25,335 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 76 [2019-10-15 03:27:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,335 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-10-15 03:27:25,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-10-15 03:27:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:27:25,336 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,336 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:25,337 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1035009016, now seen corresponding path program 1 times [2019-10-15 03:27:25,337 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979360689] [2019-10-15 03:27:25,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,391 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:25,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979360689] [2019-10-15 03:27:25,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:27:25,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073575716] [2019-10-15 03:27:25,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:27:25,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:27:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:27:25,393 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 4 states. [2019-10-15 03:27:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:25,461 INFO L93 Difference]: Finished difference Result 366 states and 504 transitions. [2019-10-15 03:27:25,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:27:25,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-15 03:27:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:25,465 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:27:25,465 INFO L226 Difference]: Without dead ends: 208 [2019-10-15 03:27:25,467 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:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-15 03:27:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-15 03:27:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-15 03:27:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2019-10-15 03:27:25,482 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 78 [2019-10-15 03:27:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:25,484 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2019-10-15 03:27:25,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:27:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2019-10-15 03:27:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 03:27:25,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:25,487 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:25,487 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:25,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1089906055, now seen corresponding path program 1 times [2019-10-15 03:27:25,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:25,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276367788] [2019-10-15 03:27:25,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:25,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,549 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:25,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276367788] [2019-10-15 03:27:25,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367181083] [2019-10-15 03:27:25,550 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:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:25,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:27:25,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:27:25,762 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:25,763 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:27:25,935 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:25,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1362381017] [2019-10-15 03:27:25,971 INFO L162 IcfgInterpreter]: Started Sifa with 58 locations of interest [2019-10-15 03:27:25,971 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:27:25,978 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:27:25,985 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:27:25,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:27:26,711 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 169 for LOIs [2019-10-15 03:27:26,902 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-15 03:27:27,153 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 241 [2019-10-15 03:27:29,983 INFO L199 IcfgInterpreter]: Interpreting procedure gate1_each_pals_period with input of size 119 for LOIs [2019-10-15 03:27:30,034 INFO L199 IcfgInterpreter]: Interpreting procedure write_history_bool with input of size 119 for LOIs [2019-10-15 03:27:30,125 INFO L199 IcfgInterpreter]: Interpreting procedure assert with input of size 1 for LOIs [2019-10-15 03:27:30,127 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2019-10-15 03:27:30,165 INFO L199 IcfgInterpreter]: Interpreting procedure init with input of size 89 for LOIs [2019-10-15 03:27:35,405 INFO L199 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 113 for LOIs [2019-10-15 03:27:40,540 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:40,764 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:41,009 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:41,257 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:41,450 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:41,659 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:42,264 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:42,443 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:42,671 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:42,865 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:43,061 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:43,264 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,712 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:43,956 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:44,244 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:44,469 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:44,662 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:44,846 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:45,174 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:45,386 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:45,633 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:45,853 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:46,064 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:46,275 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:46,576 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:46,769 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:46,992 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:47,194 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:47,451 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:47,639 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:47,910 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,113 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:48,325 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,531 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:48,728 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:48,930 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:49,236 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:49,431 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:49,654 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:49,848 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:50,062 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:50,252 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:50,534 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:50,727 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:50,974 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:51,149 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:51,341 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:51,546 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:51,836 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,036 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,262 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:52,457 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:52,657 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:52,861 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:53,182 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:53,384 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:53,628 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:53,819 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,016 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,229 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:54,514 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:54,710 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:54,925 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:55,128 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:55,331 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:55,532 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:55,819 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:56,022 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:56,233 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-10-15 03:27:56,439 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-15 03:27:56,651 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65