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/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:14:32,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:14:32,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:14:32,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:14:32,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:14:32,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:14:32,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:14:32,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:14:32,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:14:32,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:14:32,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:14:32,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:14:32,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:14:32,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:14:32,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:14:32,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:14:32,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:14:32,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:14:32,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:14:32,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:14:32,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:14:32,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:14:32,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:14:32,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:14:32,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:14:32,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:14:32,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:14:32,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:14:32,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:14:32,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:14:32,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:14:32,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:14:32,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:14:32,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:14:32,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:14:32,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:14:32,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:14:32,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:14:32,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:14:32,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:14:32,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:14:32,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 17:14:32,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:14:32,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:14:32,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:14:32,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:14:32,838 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:14:32,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:14:32,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:14:32,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:14:32,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:14:32,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:14:32,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:14:32,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:14:32,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:14:32,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:14:32,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:14:32,840 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:14:32,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:14:32,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:14:32,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:14:32,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:14:32,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:14:32,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:14:32,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:14:32,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:14:32,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:14:32,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:14:32,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:14:32,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:14:32,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 17:14:33,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:14:33,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:14:33,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:14:33,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:14:33,167 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:14:33,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-07 17:14:33,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54eb13f1/a0b2d435bafa4ea18bd593733b96c4b8/FLAG99bab5017 [2019-10-07 17:14:33,689 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:14:33,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-1.c [2019-10-07 17:14:33,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54eb13f1/a0b2d435bafa4ea18bd593733b96c4b8/FLAG99bab5017 [2019-10-07 17:14:34,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54eb13f1/a0b2d435bafa4ea18bd593733b96c4b8 [2019-10-07 17:14:34,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:14:34,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:14:34,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:14:34,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:14:34,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:14:34,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34930f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34, skipping insertion in model container [2019-10-07 17:14:34,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,093 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:14:34,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:14:34,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:14:34,391 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:14:34,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:14:34,560 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:14:34,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34 WrapperNode [2019-10-07 17:14:34,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:14:34,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:14:34,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:14:34,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:14:34,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... [2019-10-07 17:14:34,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:14:34,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:14:34,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:14:34,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:14:34,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:14:34,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:14:34,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:14:34,682 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:14:34,683 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-07 17:14:34,683 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-07 17:14:34,683 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-07 17:14:34,683 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-07 17:14:34,683 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:14:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:14:34,685 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:14:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:14:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:14:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:14:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:14:34,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:14:34,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:14:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:14:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-07 17:14:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-07 17:14:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-07 17:14:34,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-07 17:14:34,688 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:14:34,689 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:14:34,690 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:14:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:14:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:14:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:14:35,764 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:14:35,765 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-07 17:14:35,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:14:35 BoogieIcfgContainer [2019-10-07 17:14:35,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:14:35,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:14:35,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:14:35,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:14:35,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:14:34" (1/3) ... [2019-10-07 17:14:35,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d34996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:14:35, skipping insertion in model container [2019-10-07 17:14:35,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:14:34" (2/3) ... [2019-10-07 17:14:35,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d34996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:14:35, skipping insertion in model container [2019-10-07 17:14:35,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:14:35" (3/3) ... [2019-10-07 17:14:35,775 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-10-07 17:14:35,784 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:14:35,793 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:14:35,803 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:14:35,831 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:14:35,831 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:14:35,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:14:35,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:14:35,835 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:14:35,836 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:14:35,836 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:14:35,836 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:14:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-10-07 17:14:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 17:14:35,886 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:35,887 INFO L385 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] [2019-10-07 17:14:35,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1944161368, now seen corresponding path program 1 times [2019-10-07 17:14:35,905 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:35,906 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:35,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:35,906 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:14:36,269 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:36,270 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:36,271 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:14:36,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:14:36,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:14:36,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:14:36,291 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2019-10-07 17:14:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:36,451 INFO L93 Difference]: Finished difference Result 395 states and 548 transitions. [2019-10-07 17:14:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:14:36,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-07 17:14:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:36,485 INFO L225 Difference]: With dead ends: 395 [2019-10-07 17:14:36,486 INFO L226 Difference]: Without dead ends: 252 [2019-10-07 17:14:36,497 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:14:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-07 17:14:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-10-07 17:14:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-07 17:14:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 335 transitions. [2019-10-07 17:14:36,612 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 335 transitions. Word has length 71 [2019-10-07 17:14:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:36,616 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 335 transitions. [2019-10-07 17:14:36,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:14:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 335 transitions. [2019-10-07 17:14:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 17:14:36,630 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:36,631 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 17:14:36,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -412651718, now seen corresponding path program 1 times [2019-10-07 17:14:36,632 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:36,632 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:36,632 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:36,633 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-07 17:14:36,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:36,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:36,852 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:14:36,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:36,860 INFO L87 Difference]: Start difference. First operand 251 states and 335 transitions. Second operand 4 states. [2019-10-07 17:14:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:37,020 INFO L93 Difference]: Finished difference Result 644 states and 902 transitions. [2019-10-07 17:14:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:37,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-10-07 17:14:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:37,027 INFO L225 Difference]: With dead ends: 644 [2019-10-07 17:14:37,027 INFO L226 Difference]: Without dead ends: 410 [2019-10-07 17:14:37,029 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-07 17:14:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2019-10-07 17:14:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-10-07 17:14:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 523 transitions. [2019-10-07 17:14:37,093 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 523 transitions. Word has length 123 [2019-10-07 17:14:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:37,094 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 523 transitions. [2019-10-07 17:14:37,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 523 transitions. [2019-10-07 17:14:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 17:14:37,105 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:37,107 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:14:37,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1563024248, now seen corresponding path program 1 times [2019-10-07 17:14:37,109 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:37,109 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:37,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:37,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:37,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-07 17:14:37,348 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:37,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:37,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:14:37,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 17:14:37,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-07 17:14:37,895 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:14:37,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-07 17:14:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:37,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:37,897 INFO L87 Difference]: Start difference. First operand 371 states and 523 transitions. Second operand 4 states. [2019-10-07 17:14:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:38,184 INFO L93 Difference]: Finished difference Result 1065 states and 1644 transitions. [2019-10-07 17:14:38,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:38,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-07 17:14:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:38,192 INFO L225 Difference]: With dead ends: 1065 [2019-10-07 17:14:38,192 INFO L226 Difference]: Without dead ends: 710 [2019-10-07 17:14:38,195 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-07 17:14:38,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 688. [2019-10-07 17:14:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-07 17:14:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 961 transitions. [2019-10-07 17:14:38,270 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 961 transitions. Word has length 164 [2019-10-07 17:14:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:38,273 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 961 transitions. [2019-10-07 17:14:38,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 961 transitions. [2019-10-07 17:14:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 17:14:38,280 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:38,281 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:14:38,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:38,494 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash -897899996, now seen corresponding path program 1 times [2019-10-07 17:14:38,494 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:38,494 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:38,494 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:38,495 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-07 17:14:38,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:38,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:38,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:14:38,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 17:14:38,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-07 17:14:39,124 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:14:39,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-07 17:14:39,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:39,126 INFO L87 Difference]: Start difference. First operand 688 states and 961 transitions. Second operand 4 states. [2019-10-07 17:14:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:39,405 INFO L93 Difference]: Finished difference Result 2001 states and 3052 transitions. [2019-10-07 17:14:39,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:39,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-07 17:14:39,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:39,416 INFO L225 Difference]: With dead ends: 2001 [2019-10-07 17:14:39,416 INFO L226 Difference]: Without dead ends: 1329 [2019-10-07 17:14:39,421 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-10-07 17:14:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1299. [2019-10-07 17:14:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2019-10-07 17:14:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1793 transitions. [2019-10-07 17:14:39,514 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1793 transitions. Word has length 164 [2019-10-07 17:14:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:39,515 INFO L462 AbstractCegarLoop]: Abstraction has 1299 states and 1793 transitions. [2019-10-07 17:14:39,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1793 transitions. [2019-10-07 17:14:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-07 17:14:39,521 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:39,521 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-07 17:14:39,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:39,735 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:39,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash -621454025, now seen corresponding path program 1 times [2019-10-07 17:14:39,737 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:39,737 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:39,737 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:39,738 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-07 17:14:39,872 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:39,872 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:39,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:40,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:14:40,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 17:14:40,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-07 17:14:40,290 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:14:40,290 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-10-07 17:14:40,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:40,292 INFO L87 Difference]: Start difference. First operand 1299 states and 1793 transitions. Second operand 4 states. [2019-10-07 17:14:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:40,649 INFO L93 Difference]: Finished difference Result 3803 states and 5732 transitions. [2019-10-07 17:14:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:40,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-07 17:14:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:40,672 INFO L225 Difference]: With dead ends: 3803 [2019-10-07 17:14:40,673 INFO L226 Difference]: Without dead ends: 2520 [2019-10-07 17:14:40,693 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-10-07 17:14:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2474. [2019-10-07 17:14:40,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2019-10-07 17:14:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3375 transitions. [2019-10-07 17:14:40,890 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3375 transitions. Word has length 164 [2019-10-07 17:14:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:40,890 INFO L462 AbstractCegarLoop]: Abstraction has 2474 states and 3375 transitions. [2019-10-07 17:14:40,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3375 transitions. [2019-10-07 17:14:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-07 17:14:40,903 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:40,903 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:41,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:41,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:41,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1658173048, now seen corresponding path program 1 times [2019-10-07 17:14:41,112 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:41,112 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:41,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:41,113 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-07 17:14:41,264 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:41,264 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:41,264 INFO L95 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-10-07 17:14:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:41,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:14:41,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 17:14:41,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-07 17:14:41,723 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:41,724 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 3] total 10 [2019-10-07 17:14:41,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:14:41,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:14:41,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:14:41,725 INFO L87 Difference]: Start difference. First operand 2474 states and 3375 transitions. Second operand 3 states. [2019-10-07 17:14:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:41,925 INFO L93 Difference]: Finished difference Result 4601 states and 6428 transitions. [2019-10-07 17:14:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:14:41,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-10-07 17:14:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:41,949 INFO L225 Difference]: With dead ends: 4601 [2019-10-07 17:14:41,949 INFO L226 Difference]: Without dead ends: 3377 [2019-10-07 17:14:41,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 357 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-10-07 17:14:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2019-10-07 17:14:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 2834. [2019-10-07 17:14:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2834 states. [2019-10-07 17:14:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 3885 transitions. [2019-10-07 17:14:42,178 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 3885 transitions. Word has length 179 [2019-10-07 17:14:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:42,178 INFO L462 AbstractCegarLoop]: Abstraction has 2834 states and 3885 transitions. [2019-10-07 17:14:42,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:14:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 3885 transitions. [2019-10-07 17:14:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-07 17:14:42,193 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:42,193 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:42,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:42,405 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1797323528, now seen corresponding path program 1 times [2019-10-07 17:14:42,406 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:42,406 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:42,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:42,406 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-07 17:14:42,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:42,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:42,639 INFO L95 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-10-07 17:14:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:42,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 17:14:42,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 17:14:42,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-07 17:14:43,372 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:43,372 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 4] total 12 [2019-10-07 17:14:43,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:14:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:14:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-07 17:14:43,373 INFO L87 Difference]: Start difference. First operand 2834 states and 3885 transitions. Second operand 6 states. [2019-10-07 17:14:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:43,960 INFO L93 Difference]: Finished difference Result 4554 states and 6425 transitions. [2019-10-07 17:14:43,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 17:14:43,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 246 [2019-10-07 17:14:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:43,981 INFO L225 Difference]: With dead ends: 4554 [2019-10-07 17:14:43,981 INFO L226 Difference]: Without dead ends: 3177 [2019-10-07 17:14:43,994 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 494 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:14:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2019-10-07 17:14:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3177. [2019-10-07 17:14:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3177 states. [2019-10-07 17:14:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4246 transitions. [2019-10-07 17:14:44,236 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4246 transitions. Word has length 246 [2019-10-07 17:14:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:44,237 INFO L462 AbstractCegarLoop]: Abstraction has 3177 states and 4246 transitions. [2019-10-07 17:14:44,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:14:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4246 transitions. [2019-10-07 17:14:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-07 17:14:44,251 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:44,251 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:44,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:44,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1376038240, now seen corresponding path program 1 times [2019-10-07 17:14:44,458 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:44,458 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:44,459 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:44,459 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-07 17:14:44,595 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:44,595 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:44,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:14:44,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:14:44,944 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-07 17:14:45,143 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:14:45,143 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [8] total 10 [2019-10-07 17:14:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:14:45,144 INFO L87 Difference]: Start difference. First operand 3177 states and 4246 transitions. Second operand 4 states. [2019-10-07 17:14:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:45,495 INFO L93 Difference]: Finished difference Result 5429 states and 7337 transitions. [2019-10-07 17:14:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:45,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-10-07 17:14:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:45,526 INFO L225 Difference]: With dead ends: 5429 [2019-10-07 17:14:45,526 INFO L226 Difference]: Without dead ends: 3725 [2019-10-07 17:14:45,547 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 351 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:14:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2019-10-07 17:14:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3725. [2019-10-07 17:14:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3725 states. [2019-10-07 17:14:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 4808 transitions. [2019-10-07 17:14:45,895 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 4808 transitions. Word has length 179 [2019-10-07 17:14:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:45,896 INFO L462 AbstractCegarLoop]: Abstraction has 3725 states and 4808 transitions. [2019-10-07 17:14:45,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 4808 transitions. [2019-10-07 17:14:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-07 17:14:45,911 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:45,912 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:46,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:46,122 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2034937731, now seen corresponding path program 1 times [2019-10-07 17:14:46,123 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:46,124 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:46,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:46,124 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:46,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-07 17:14:46,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:46,321 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:46,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:14:46,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-07 17:14:46,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:46,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:47,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-07 17:14:47,156 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:47,157 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 7] total 18 [2019-10-07 17:14:47,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:14:47,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:14:47,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-07 17:14:47,160 INFO L87 Difference]: Start difference. First operand 3725 states and 4808 transitions. Second operand 9 states. [2019-10-07 17:14:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:48,408 INFO L93 Difference]: Finished difference Result 10037 states and 14147 transitions. [2019-10-07 17:14:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 17:14:48,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 180 [2019-10-07 17:14:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:48,452 INFO L225 Difference]: With dead ends: 10037 [2019-10-07 17:14:48,452 INFO L226 Difference]: Without dead ends: 6329 [2019-10-07 17:14:48,485 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2019-10-07 17:14:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2019-10-07 17:14:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 6145. [2019-10-07 17:14:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2019-10-07 17:14:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 8504 transitions. [2019-10-07 17:14:48,969 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 8504 transitions. Word has length 180 [2019-10-07 17:14:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:48,972 INFO L462 AbstractCegarLoop]: Abstraction has 6145 states and 8504 transitions. [2019-10-07 17:14:48,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:14:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 8504 transitions. [2019-10-07 17:14:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-07 17:14:49,005 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:49,005 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:49,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:49,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:49,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1673377876, now seen corresponding path program 1 times [2019-10-07 17:14:49,213 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:49,213 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:49,213 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:49,213 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-10-07 17:14:49,530 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:49,530 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:49,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 17:14:49,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-07 17:14:49,835 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-10-07 17:14:50,033 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:50,034 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-10-07 17:14:50,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:14:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:14:50,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:50,035 INFO L87 Difference]: Start difference. First operand 6145 states and 8504 transitions. Second operand 3 states. [2019-10-07 17:14:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:50,227 INFO L93 Difference]: Finished difference Result 10360 states and 15004 transitions. [2019-10-07 17:14:50,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:14:50,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-10-07 17:14:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:50,269 INFO L225 Difference]: With dead ends: 10360 [2019-10-07 17:14:50,270 INFO L226 Difference]: Without dead ends: 5958 [2019-10-07 17:14:50,302 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2019-10-07 17:14:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 5950. [2019-10-07 17:14:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5950 states. [2019-10-07 17:14:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 8171 transitions. [2019-10-07 17:14:50,782 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 8171 transitions. Word has length 249 [2019-10-07 17:14:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:50,783 INFO L462 AbstractCegarLoop]: Abstraction has 5950 states and 8171 transitions. [2019-10-07 17:14:50,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:14:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 8171 transitions. [2019-10-07 17:14:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 17:14:50,814 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:50,814 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:51,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:51,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1283089672, now seen corresponding path program 1 times [2019-10-07 17:14:51,019 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:51,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:51,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:51,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:51,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 45 proven. 27 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-10-07 17:14:51,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:51,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:51,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:51,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:14:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 139 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-07 17:14:51,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:52,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:52,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:52,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:52,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-07 17:14:52,254 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:14:52,289 INFO L162 IcfgInterpreter]: Started Sifa with 111 locations of interest [2019-10-07 17:14:52,290 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:14:52,296 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:14:52,304 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:14:52,304 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:14:52,625 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 67 for LOIs [2019-10-07 17:14:52,670 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 111 for LOIs [2019-10-07 17:14:53,404 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 67 for LOIs [2019-10-07 17:14:53,489 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 120 for LOIs [2019-10-07 17:14:54,207 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 17:14:57,602 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-07 17:14:57,645 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-10-07 17:14:58,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:58,159 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 17:14:58,166 INFO L168 Benchmark]: Toolchain (without parser) took 24089.01 ms. Allocated memory was 145.2 MB in the beginning and 1.1 GB in the end (delta: 981.5 MB). Free memory was 103.0 MB in the beginning and 1.0 GB in the end (delta: -922.8 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,167 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.56 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.8 MB in the beginning and 177.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,168 INFO L168 Benchmark]: Boogie Preprocessor took 52.22 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,169 INFO L168 Benchmark]: RCFGBuilder took 1152.02 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 175.7 MB in the beginning and 201.2 MB in the end (delta: -25.5 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,170 INFO L168 Benchmark]: TraceAbstraction took 22395.42 ms. Allocated memory was 235.4 MB in the beginning and 1.1 GB in the end (delta: 891.3 MB). Free memory was 201.2 MB in the beginning and 1.0 GB in the end (delta: -824.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:58,178 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 484.56 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.8 MB in the beginning and 177.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.22 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1152.02 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 175.7 MB in the beginning and 201.2 MB in the end (delta: -25.5 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22395.42 ms. Allocated memory was 235.4 MB in the beginning and 1.1 GB in the end (delta: 891.3 MB). Free memory was 201.2 MB in the beginning and 1.0 GB in the end (delta: -824.6 MB). Peak memory consumption was 66.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: ε: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...