/usr/bin/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/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:51:11,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:51:11,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:51:11,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:51:11,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:51:11,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:51:11,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:51:11,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:51:11,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:51:11,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:51:11,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:51:11,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:51:11,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:51:11,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:51:11,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:51:11,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:51:11,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:51:11,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:51:11,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:51:11,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:51:11,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:51:11,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:51:11,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:51:11,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:51:11,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:51:11,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:51:11,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:51:11,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:51:11,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:51:11,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:51:11,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:51:11,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:51:11,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:51:11,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:51:11,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:51:11,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:51:11,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:51:11,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:51:11,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:51:11,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:51:11,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:51:11,671 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-11-07 04:51:11,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:51:11,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:51:11,710 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:51:11,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:51:11,711 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:51:11,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:51:11,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:51:11,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:51:11,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:51:11,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:51:11,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:51:11,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:51:11,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:51:11,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:51:11,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:51:11,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:51:11,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:51:11,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:51:11,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:51:11,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:51:11,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:51:11,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:51:11,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:51:11,716 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-11-07 04:51:12,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:51:12,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:51:12,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:51:12,040 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:51:12,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:51:12,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-07 04:51:12,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229e2091d/a15c3ee0989a4e888ec8d852f1088a43/FLAGac4e91c42 [2019-11-07 04:51:12,598 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:51:12,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-11-07 04:51:12,619 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229e2091d/a15c3ee0989a4e888ec8d852f1088a43/FLAGac4e91c42 [2019-11-07 04:51:13,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/229e2091d/a15c3ee0989a4e888ec8d852f1088a43 [2019-11-07 04:51:13,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:51:13,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:51:13,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:51:13,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:51:13,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:51:13,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521920b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13, skipping insertion in model container [2019-11-07 04:51:13,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,077 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:51:13,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:51:13,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:51:13,401 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:51:13,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:51:13,577 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:51:13,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13 WrapperNode [2019-11-07 04:51:13,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:51:13,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:51:13,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:51:13,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:51:13,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (1/1) ... [2019-11-07 04:51:13,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:51:13,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:51:13,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:51:13,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:51:13,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (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-11-07 04:51:13,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-07 04:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-11-07 04:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-11-07 04:51:13,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-11-07 04:51:13,684 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-07 04:51:13,685 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-07 04:51:13,685 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-07 04:51:13,685 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-07 04:51:13,685 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-07 04:51:13,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-07 04:51:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-07 04:51:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-07 04:51:13,688 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:51:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:51:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:51:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-07 04:51:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-11-07 04:51:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-07 04:51:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-07 04:51:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-07 04:51:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:51:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:51:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:51:14,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:51:14,543 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-07 04:51:14,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:14 BoogieIcfgContainer [2019-11-07 04:51:14,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:51:14,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:51:14,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:51:14,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:51:14,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:51:13" (1/3) ... [2019-11-07 04:51:14,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b68aa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:14, skipping insertion in model container [2019-11-07 04:51:14,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:51:13" (2/3) ... [2019-11-07 04:51:14,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b68aa0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:51:14, skipping insertion in model container [2019-11-07 04:51:14,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:51:14" (3/3) ... [2019-11-07 04:51:14,552 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-11-07 04:51:14,562 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:51:14,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:51:14,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:51:14,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:51:14,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:51:14,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:51:14,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:51:14,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:51:14,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:51:14,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:51:14,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:51:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-11-07 04:51:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 04:51:14,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:14,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:14,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:14,646 INFO L82 PathProgramCache]: Analyzing trace with hash -555226142, now seen corresponding path program 1 times [2019-11-07 04:51:14,653 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:14,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894243214] [2019-11-07 04:51:14,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:14,967 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894243214] [2019-11-07 04:51:14,967 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:14,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:51:14,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337973188] [2019-11-07 04:51:14,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:14,975 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:14,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:14,989 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2019-11-07 04:51:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:15,492 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2019-11-07 04:51:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:15,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-07 04:51:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:15,518 INFO L225 Difference]: With dead ends: 403 [2019-11-07 04:51:15,518 INFO L226 Difference]: Without dead ends: 260 [2019-11-07 04:51:15,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-07 04:51:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-07 04:51:15,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2019-11-07 04:51:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-11-07 04:51:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 321 transitions. [2019-11-07 04:51:15,616 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 321 transitions. Word has length 66 [2019-11-07 04:51:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:15,617 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 321 transitions. [2019-11-07 04:51:15,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 321 transitions. [2019-11-07 04:51:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-07 04:51:15,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:15,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:15,621 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1974924545, now seen corresponding path program 1 times [2019-11-07 04:51:15,622 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:15,622 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238278477] [2019-11-07 04:51:15,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:15,790 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238278477] [2019-11-07 04:51:15,790 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:15,790 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:51:15,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27207091] [2019-11-07 04:51:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:15,797 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:15,798 INFO L87 Difference]: Start difference. First operand 253 states and 321 transitions. Second operand 4 states. [2019-11-07 04:51:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:16,184 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2019-11-07 04:51:16,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:16,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-07 04:51:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:16,199 INFO L225 Difference]: With dead ends: 718 [2019-11-07 04:51:16,199 INFO L226 Difference]: Without dead ends: 481 [2019-11-07 04:51:16,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:16,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-07 04:51:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 458. [2019-11-07 04:51:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-07 04:51:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 573 transitions. [2019-11-07 04:51:16,293 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 573 transitions. Word has length 66 [2019-11-07 04:51:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:16,294 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 573 transitions. [2019-11-07 04:51:16,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 573 transitions. [2019-11-07 04:51:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-07 04:51:16,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:16,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:16,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash -53869737, now seen corresponding path program 1 times [2019-11-07 04:51:16,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:16,298 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458598399] [2019-11-07 04:51:16,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:16,530 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458598399] [2019-11-07 04:51:16,530 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:16,531 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:51:16,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173674579] [2019-11-07 04:51:16,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:51:16,532 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:51:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:51:16,532 INFO L87 Difference]: Start difference. First operand 458 states and 573 transitions. Second operand 6 states. [2019-11-07 04:51:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:16,669 INFO L93 Difference]: Finished difference Result 1196 states and 1548 transitions. [2019-11-07 04:51:16,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:51:16,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-07 04:51:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:16,676 INFO L225 Difference]: With dead ends: 1196 [2019-11-07 04:51:16,677 INFO L226 Difference]: Without dead ends: 755 [2019-11-07 04:51:16,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:51:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-11-07 04:51:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 731. [2019-11-07 04:51:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-11-07 04:51:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 927 transitions. [2019-11-07 04:51:16,746 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 927 transitions. Word has length 67 [2019-11-07 04:51:16,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:16,748 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 927 transitions. [2019-11-07 04:51:16,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:51:16,748 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 927 transitions. [2019-11-07 04:51:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-07 04:51:16,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:16,752 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:16,756 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash 712803888, now seen corresponding path program 1 times [2019-11-07 04:51:16,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:16,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645647207] [2019-11-07 04:51:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:17,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:17,052 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645647207] [2019-11-07 04:51:17,052 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:17,053 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:51:17,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204559963] [2019-11-07 04:51:17,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:51:17,054 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:51:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:51:17,054 INFO L87 Difference]: Start difference. First operand 731 states and 927 transitions. Second operand 8 states. [2019-11-07 04:51:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:18,507 INFO L93 Difference]: Finished difference Result 2380 states and 3439 transitions. [2019-11-07 04:51:18,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:51:18,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-11-07 04:51:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:18,523 INFO L225 Difference]: With dead ends: 2380 [2019-11-07 04:51:18,524 INFO L226 Difference]: Without dead ends: 1762 [2019-11-07 04:51:18,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:51:18,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-11-07 04:51:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1649. [2019-11-07 04:51:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-11-07 04:51:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2319 transitions. [2019-11-07 04:51:18,730 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2319 transitions. Word has length 80 [2019-11-07 04:51:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:18,732 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2319 transitions. [2019-11-07 04:51:18,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:51:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2319 transitions. [2019-11-07 04:51:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 04:51:18,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:18,736 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:18,736 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash -852047705, now seen corresponding path program 1 times [2019-11-07 04:51:18,737 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:18,738 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769082004] [2019-11-07 04:51:18,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:19,001 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769082004] [2019-11-07 04:51:19,002 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:19,002 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:51:19,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465298413] [2019-11-07 04:51:19,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:51:19,004 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:19,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:51:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:51:19,005 INFO L87 Difference]: Start difference. First operand 1649 states and 2319 transitions. Second operand 9 states. [2019-11-07 04:51:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:20,841 INFO L93 Difference]: Finished difference Result 1945 states and 2959 transitions. [2019-11-07 04:51:20,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:51:20,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-07 04:51:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:20,862 INFO L225 Difference]: With dead ends: 1945 [2019-11-07 04:51:20,863 INFO L226 Difference]: Without dead ends: 1942 [2019-11-07 04:51:20,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:51:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-07 04:51:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1753. [2019-11-07 04:51:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-11-07 04:51:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2548 transitions. [2019-11-07 04:51:21,057 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2548 transitions. Word has length 85 [2019-11-07 04:51:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:21,058 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 2548 transitions. [2019-11-07 04:51:21,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:51:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2548 transitions. [2019-11-07 04:51:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 04:51:21,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:21,061 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:21,061 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2099101405, now seen corresponding path program 1 times [2019-11-07 04:51:21,062 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:21,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661489298] [2019-11-07 04:51:21,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:51:21,164 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661489298] [2019-11-07 04:51:21,165 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945089486] [2019-11-07 04:51:21,165 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-11-07 04:51:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:21,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:51:21,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:51:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:21,451 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:51:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:51:21,556 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:51:21,556 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-07 04:51:21,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939054128] [2019-11-07 04:51:21,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:21,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:51:21,560 INFO L87 Difference]: Start difference. First operand 1753 states and 2548 transitions. Second operand 4 states. [2019-11-07 04:51:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:21,755 INFO L93 Difference]: Finished difference Result 4472 states and 6595 transitions. [2019-11-07 04:51:21,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:21,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-07 04:51:21,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:21,775 INFO L225 Difference]: With dead ends: 4472 [2019-11-07 04:51:21,775 INFO L226 Difference]: Without dead ends: 2736 [2019-11-07 04:51:21,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:51:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-11-07 04:51:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2249. [2019-11-07 04:51:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-11-07 04:51:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3231 transitions. [2019-11-07 04:51:21,987 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3231 transitions. Word has length 85 [2019-11-07 04:51:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:21,987 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 3231 transitions. [2019-11-07 04:51:21,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3231 transitions. [2019-11-07 04:51:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-07 04:51:21,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:21,991 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:22,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:22,197 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:22,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1219328812, now seen corresponding path program 1 times [2019-11-07 04:51:22,198 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:22,199 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759859879] [2019-11-07 04:51:22,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:51:22,304 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759859879] [2019-11-07 04:51:22,304 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:22,304 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:51:22,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799656166] [2019-11-07 04:51:22,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:51:22,306 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:22,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:51:22,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:51:22,307 INFO L87 Difference]: Start difference. First operand 2249 states and 3231 transitions. Second operand 7 states. [2019-11-07 04:51:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:22,970 INFO L93 Difference]: Finished difference Result 5841 states and 8726 transitions. [2019-11-07 04:51:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:51:22,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-11-07 04:51:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:23,011 INFO L225 Difference]: With dead ends: 5841 [2019-11-07 04:51:23,011 INFO L226 Difference]: Without dead ends: 3695 [2019-11-07 04:51:23,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:51:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2019-11-07 04:51:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3614. [2019-11-07 04:51:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2019-11-07 04:51:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5213 transitions. [2019-11-07 04:51:23,386 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5213 transitions. Word has length 96 [2019-11-07 04:51:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:23,388 INFO L462 AbstractCegarLoop]: Abstraction has 3614 states and 5213 transitions. [2019-11-07 04:51:23,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:51:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5213 transitions. [2019-11-07 04:51:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-07 04:51:23,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:23,395 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:23,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1715576570, now seen corresponding path program 1 times [2019-11-07 04:51:23,396 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:23,396 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390978764] [2019-11-07 04:51:23,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 04:51:23,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390978764] [2019-11-07 04:51:23,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:23,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:51:23,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242359534] [2019-11-07 04:51:23,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:51:23,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:51:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:51:23,636 INFO L87 Difference]: Start difference. First operand 3614 states and 5213 transitions. Second operand 8 states. [2019-11-07 04:51:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:24,386 INFO L93 Difference]: Finished difference Result 8140 states and 12009 transitions. [2019-11-07 04:51:24,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:51:24,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-11-07 04:51:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:24,428 INFO L225 Difference]: With dead ends: 8140 [2019-11-07 04:51:24,428 INFO L226 Difference]: Without dead ends: 3993 [2019-11-07 04:51:24,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:51:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2019-11-07 04:51:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 3877. [2019-11-07 04:51:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2019-11-07 04:51:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5668 transitions. [2019-11-07 04:51:24,788 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5668 transitions. Word has length 100 [2019-11-07 04:51:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:24,789 INFO L462 AbstractCegarLoop]: Abstraction has 3877 states and 5668 transitions. [2019-11-07 04:51:24,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:51:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5668 transitions. [2019-11-07 04:51:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-07 04:51:24,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:24,794 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:24,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -518224059, now seen corresponding path program 1 times [2019-11-07 04:51:24,797 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:24,797 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517452366] [2019-11-07 04:51:24,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:51:24,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517452366] [2019-11-07 04:51:24,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337562921] [2019-11-07 04:51:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:25,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:51:25,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:51:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 04:51:25,124 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:51:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 04:51:25,219 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:51:25,220 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-11-07 04:51:25,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674205977] [2019-11-07 04:51:25,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:51:25,222 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:51:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:51:25,223 INFO L87 Difference]: Start difference. First operand 3877 states and 5668 transitions. Second operand 3 states. [2019-11-07 04:51:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:25,576 INFO L93 Difference]: Finished difference Result 9626 states and 14451 transitions. [2019-11-07 04:51:25,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:51:25,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-07 04:51:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:25,624 INFO L225 Difference]: With dead ends: 9626 [2019-11-07 04:51:25,625 INFO L226 Difference]: Without dead ends: 5766 [2019-11-07 04:51:25,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:51:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-11-07 04:51:26,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5210. [2019-11-07 04:51:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5210 states. [2019-11-07 04:51:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7507 transitions. [2019-11-07 04:51:26,249 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7507 transitions. Word has length 102 [2019-11-07 04:51:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:26,249 INFO L462 AbstractCegarLoop]: Abstraction has 5210 states and 7507 transitions. [2019-11-07 04:51:26,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:51:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7507 transitions. [2019-11-07 04:51:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-07 04:51:26,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:26,253 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:26,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:26,466 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 468891600, now seen corresponding path program 1 times [2019-11-07 04:51:26,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:26,467 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238249722] [2019-11-07 04:51:26,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:51:26,596 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238249722] [2019-11-07 04:51:26,596 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833080493] [2019-11-07 04:51:26,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:26,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-07 04:51:26,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:51:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 04:51:26,778 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:51:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:51:26,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:51:26,874 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-11-07 04:51:26,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260526491] [2019-11-07 04:51:26,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:26,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:51:26,876 INFO L87 Difference]: Start difference. First operand 5210 states and 7507 transitions. Second operand 4 states. [2019-11-07 04:51:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:27,509 INFO L93 Difference]: Finished difference Result 13475 states and 19117 transitions. [2019-11-07 04:51:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:27,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-07 04:51:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:27,588 INFO L225 Difference]: With dead ends: 13475 [2019-11-07 04:51:27,589 INFO L226 Difference]: Without dead ends: 8282 [2019-11-07 04:51:27,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:51:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-11-07 04:51:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 7341. [2019-11-07 04:51:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7341 states. [2019-11-07 04:51:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10069 transitions. [2019-11-07 04:51:28,058 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10069 transitions. Word has length 104 [2019-11-07 04:51:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:28,060 INFO L462 AbstractCegarLoop]: Abstraction has 7341 states and 10069 transitions. [2019-11-07 04:51:28,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10069 transitions. [2019-11-07 04:51:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-07 04:51:28,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:28,065 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:28,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:28,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1692868379, now seen corresponding path program 1 times [2019-11-07 04:51:28,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:28,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045544645] [2019-11-07 04:51:28,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:51:28,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045544645] [2019-11-07 04:51:28,342 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:28,343 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:51:28,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126424292] [2019-11-07 04:51:28,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:51:28,343 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:51:28,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:51:28,344 INFO L87 Difference]: Start difference. First operand 7341 states and 10069 transitions. Second operand 3 states. [2019-11-07 04:51:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:29,294 INFO L93 Difference]: Finished difference Result 17526 states and 24227 transitions. [2019-11-07 04:51:29,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:51:29,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-07 04:51:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:29,341 INFO L225 Difference]: With dead ends: 17526 [2019-11-07 04:51:29,341 INFO L226 Difference]: Without dead ends: 10202 [2019-11-07 04:51:29,365 INFO L630 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-11-07 04:51:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2019-11-07 04:51:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 8362. [2019-11-07 04:51:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-11-07 04:51:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 11397 transitions. [2019-11-07 04:51:29,996 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 11397 transitions. Word has length 105 [2019-11-07 04:51:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:29,996 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 11397 transitions. [2019-11-07 04:51:29,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:51:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 11397 transitions. [2019-11-07 04:51:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-07 04:51:30,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:30,001 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:51:30,002 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:30,002 INFO L82 PathProgramCache]: Analyzing trace with hash 40776413, now seen corresponding path program 1 times [2019-11-07 04:51:30,002 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:30,002 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16446890] [2019-11-07 04:51:30,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:51:30,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16446890] [2019-11-07 04:51:30,177 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:30,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:51:30,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424053674] [2019-11-07 04:51:30,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:51:30,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:30,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:51:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:51:30,179 INFO L87 Difference]: Start difference. First operand 8362 states and 11397 transitions. Second operand 12 states. [2019-11-07 04:51:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:32,109 INFO L93 Difference]: Finished difference Result 17361 states and 24030 transitions. [2019-11-07 04:51:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-07 04:51:32,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2019-11-07 04:51:32,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:32,159 INFO L225 Difference]: With dead ends: 17361 [2019-11-07 04:51:32,159 INFO L226 Difference]: Without dead ends: 9228 [2019-11-07 04:51:32,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-11-07 04:51:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2019-11-07 04:51:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8645. [2019-11-07 04:51:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-11-07 04:51:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 11903 transitions. [2019-11-07 04:51:32,777 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 11903 transitions. Word has length 106 [2019-11-07 04:51:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 11903 transitions. [2019-11-07 04:51:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:51:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 11903 transitions. [2019-11-07 04:51:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-07 04:51:32,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:32,786 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:32,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1337317932, now seen corresponding path program 1 times [2019-11-07 04:51:32,787 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:32,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369000115] [2019-11-07 04:51:32,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-07 04:51:32,870 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369000115] [2019-11-07 04:51:32,871 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:32,871 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:51:32,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482443080] [2019-11-07 04:51:32,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:32,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:32,877 INFO L87 Difference]: Start difference. First operand 8645 states and 11903 transitions. Second operand 4 states. [2019-11-07 04:51:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:33,554 INFO L93 Difference]: Finished difference Result 21983 states and 30947 transitions. [2019-11-07 04:51:33,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:33,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-07 04:51:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:33,618 INFO L225 Difference]: With dead ends: 21983 [2019-11-07 04:51:33,619 INFO L226 Difference]: Without dead ends: 13354 [2019-11-07 04:51:33,760 INFO L630 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-11-07 04:51:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13354 states. [2019-11-07 04:51:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13354 to 12947. [2019-11-07 04:51:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12947 states. [2019-11-07 04:51:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12947 states to 12947 states and 17821 transitions. [2019-11-07 04:51:34,404 INFO L78 Accepts]: Start accepts. Automaton has 12947 states and 17821 transitions. Word has length 132 [2019-11-07 04:51:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:34,405 INFO L462 AbstractCegarLoop]: Abstraction has 12947 states and 17821 transitions. [2019-11-07 04:51:34,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 12947 states and 17821 transitions. [2019-11-07 04:51:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-07 04:51:34,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:34,410 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:34,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:34,411 INFO L82 PathProgramCache]: Analyzing trace with hash -463840237, now seen corresponding path program 1 times [2019-11-07 04:51:34,411 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:34,411 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015258411] [2019-11-07 04:51:34,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-07 04:51:34,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015258411] [2019-11-07 04:51:34,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:34,476 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:51:34,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293314369] [2019-11-07 04:51:34,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:51:34,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:51:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:34,478 INFO L87 Difference]: Start difference. First operand 12947 states and 17821 transitions. Second operand 4 states. [2019-11-07 04:51:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:35,157 INFO L93 Difference]: Finished difference Result 22250 states and 30929 transitions. [2019-11-07 04:51:35,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:51:35,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-07 04:51:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:35,218 INFO L225 Difference]: With dead ends: 22250 [2019-11-07 04:51:35,219 INFO L226 Difference]: Without dead ends: 13844 [2019-11-07 04:51:35,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:51:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13844 states. [2019-11-07 04:51:35,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13844 to 13844. [2019-11-07 04:51:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13844 states. [2019-11-07 04:51:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13844 states to 13844 states and 18740 transitions. [2019-11-07 04:51:35,904 INFO L78 Accepts]: Start accepts. Automaton has 13844 states and 18740 transitions. Word has length 132 [2019-11-07 04:51:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:35,905 INFO L462 AbstractCegarLoop]: Abstraction has 13844 states and 18740 transitions. [2019-11-07 04:51:35,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:51:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13844 states and 18740 transitions. [2019-11-07 04:51:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-07 04:51:35,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:35,911 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:35,911 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1318512795, now seen corresponding path program 1 times [2019-11-07 04:51:35,911 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:35,912 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450421772] [2019-11-07 04:51:35,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 04:51:36,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450421772] [2019-11-07 04:51:36,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591219436] [2019-11-07 04:51:36,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:36,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 04:51:36,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:51:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:51:36,467 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:51:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-07 04:51:36,623 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:51:36,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 5] total 18 [2019-11-07 04:51:36,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585627870] [2019-11-07 04:51:36,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:51:36,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:36,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:51:36,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:51:36,626 INFO L87 Difference]: Start difference. First operand 13844 states and 18740 transitions. Second operand 5 states. [2019-11-07 04:51:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:37,898 INFO L93 Difference]: Finished difference Result 30974 states and 42434 transitions. [2019-11-07 04:51:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:51:37,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-11-07 04:51:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:37,989 INFO L225 Difference]: With dead ends: 30974 [2019-11-07 04:51:37,989 INFO L226 Difference]: Without dead ends: 21169 [2019-11-07 04:51:38,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:51:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21169 states. [2019-11-07 04:51:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21169 to 20189. [2019-11-07 04:51:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20189 states. [2019-11-07 04:51:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20189 states to 20189 states and 27338 transitions. [2019-11-07 04:51:39,217 INFO L78 Accepts]: Start accepts. Automaton has 20189 states and 27338 transitions. Word has length 133 [2019-11-07 04:51:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:39,218 INFO L462 AbstractCegarLoop]: Abstraction has 20189 states and 27338 transitions. [2019-11-07 04:51:39,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:51:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20189 states and 27338 transitions. [2019-11-07 04:51:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 04:51:39,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:39,225 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:39,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:39,430 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2032127136, now seen corresponding path program 1 times [2019-11-07 04:51:39,431 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:39,431 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791573500] [2019-11-07 04:51:39,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-07 04:51:39,511 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791573500] [2019-11-07 04:51:39,511 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:51:39,511 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:51:39,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828008989] [2019-11-07 04:51:39,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:51:39,512 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:51:39,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:51:39,513 INFO L87 Difference]: Start difference. First operand 20189 states and 27338 transitions. Second operand 5 states. [2019-11-07 04:51:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:51:40,701 INFO L93 Difference]: Finished difference Result 38695 states and 53527 transitions. [2019-11-07 04:51:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:51:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-11-07 04:51:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:51:40,787 INFO L225 Difference]: With dead ends: 38695 [2019-11-07 04:51:40,787 INFO L226 Difference]: Without dead ends: 21176 [2019-11-07 04:51:40,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:51:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21176 states. [2019-11-07 04:51:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21176 to 20622. [2019-11-07 04:51:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20622 states. [2019-11-07 04:51:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20622 states to 20622 states and 27838 transitions. [2019-11-07 04:51:43,063 INFO L78 Accepts]: Start accepts. Automaton has 20622 states and 27838 transitions. Word has length 145 [2019-11-07 04:51:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:51:43,063 INFO L462 AbstractCegarLoop]: Abstraction has 20622 states and 27838 transitions. [2019-11-07 04:51:43,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:51:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 20622 states and 27838 transitions. [2019-11-07 04:51:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 04:51:43,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:51:43,070 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 04:51:43,070 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:51:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:51:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1762326492, now seen corresponding path program 1 times [2019-11-07 04:51:43,070 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:51:43,071 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371262897] [2019-11-07 04:51:43,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:51:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-07 04:51:43,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371262897] [2019-11-07 04:51:43,197 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130498657] [2019-11-07 04:51:43,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:51:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:51:43,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-07 04:51:43,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:51:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 04:51:43,487 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:51:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:51:43,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:51:43,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:51:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:51:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-07 04:51:43,808 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 04:51:43,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-11-07 04:51:43,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231752861] [2019-11-07 04:51:43,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-07 04:51:43,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:51:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-07 04:51:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-11-07 04:51:43,809 INFO L87 Difference]: Start difference. First operand 20622 states and 27838 transitions. Second operand 11 states.