java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:05,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:05,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:05,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:05,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:05,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:05,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:05,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:05,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:05,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:05,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:05,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:05,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:05,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:05,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:05,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:05,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:05,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:05,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:05,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:05,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:05,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:05,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:05,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:05,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:05,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:05,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:05,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:05,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:05,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:05,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:05,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:05,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:05,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:05,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:05,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:05,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:05,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:05,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:05,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:05,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:05,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:29:05,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:05,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:05,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:05,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:05,842 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:05,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:05,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:05,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:05,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:05,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:05,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:05,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:05,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:05,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:05,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:05,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:05,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:05,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:05,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:05,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:05,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:05,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:05,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:05,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:05,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:05,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:05,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:05,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:05,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:29:06,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:06,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:06,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:06,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:06,144 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:06,145 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-13 21:29:06,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0071a4ae0/66d213113ae64f1f86bad42c18bbc767/FLAG82c097042 [2019-10-13 21:29:06,685 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:06,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-13 21:29:06,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0071a4ae0/66d213113ae64f1f86bad42c18bbc767/FLAG82c097042 [2019-10-13 21:29:07,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0071a4ae0/66d213113ae64f1f86bad42c18bbc767 [2019-10-13 21:29:07,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:07,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:07,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:07,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:07,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:07,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32777701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07, skipping insertion in model container [2019-10-13 21:29:07,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:07,148 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:07,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:07,420 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:07,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:07,590 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:07,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07 WrapperNode [2019-10-13 21:29:07,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:07,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:07,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:07,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:07,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... [2019-10-13 21:29:07,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:07,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:07,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:07,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:07,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:07,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:07,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:07,706 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-13 21:29:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-13 21:29:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-13 21:29:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-13 21:29:07,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:07,708 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 21:29:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 21:29:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 21:29:07,709 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:07,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-13 21:29:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-13 21:29:07,712 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 21:29:07,713 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:08,298 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:08,298 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:29:08,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:08 BoogieIcfgContainer [2019-10-13 21:29:08,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:08,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:08,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:08,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:08,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:07" (1/3) ... [2019-10-13 21:29:08,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8484f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:08, skipping insertion in model container [2019-10-13 21:29:08,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:07" (2/3) ... [2019-10-13 21:29:08,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8484f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:08, skipping insertion in model container [2019-10-13 21:29:08,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:08" (3/3) ... [2019-10-13 21:29:08,310 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-10-13 21:29:08,321 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:08,330 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:08,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:08,372 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:08,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:08,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:08,373 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:08,373 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:08,373 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:08,373 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:08,374 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states. [2019-10-13 21:29:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:29:08,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:08,415 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:08,417 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1619619400, now seen corresponding path program 1 times [2019-10-13 21:29:08,435 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:08,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622272705] [2019-10-13 21:29:08,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:08,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:08,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622272705] [2019-10-13 21:29:08,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:08,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:08,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157269983] [2019-10-13 21:29:08,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:08,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:08,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:08,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:08,807 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 4 states. [2019-10-13 21:29:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:09,310 INFO L93 Difference]: Finished difference Result 493 states and 700 transitions. [2019-10-13 21:29:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:09,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-13 21:29:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:09,331 INFO L225 Difference]: With dead ends: 493 [2019-10-13 21:29:09,331 INFO L226 Difference]: Without dead ends: 319 [2019-10-13 21:29:09,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-13 21:29:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 312. [2019-10-13 21:29:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-13 21:29:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 410 transitions. [2019-10-13 21:29:09,443 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 410 transitions. Word has length 82 [2019-10-13 21:29:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:09,445 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 410 transitions. [2019-10-13 21:29:09,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 410 transitions. [2019-10-13 21:29:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:29:09,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:09,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:09,463 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:09,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1801870201, now seen corresponding path program 1 times [2019-10-13 21:29:09,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:09,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943242928] [2019-10-13 21:29:09,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:09,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:09,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943242928] [2019-10-13 21:29:09,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:09,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:09,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465014286] [2019-10-13 21:29:09,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:09,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:09,708 INFO L87 Difference]: Start difference. First operand 312 states and 410 transitions. Second operand 4 states. [2019-10-13 21:29:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,056 INFO L93 Difference]: Finished difference Result 881 states and 1195 transitions. [2019-10-13 21:29:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:10,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-13 21:29:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,064 INFO L225 Difference]: With dead ends: 881 [2019-10-13 21:29:10,065 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:29:10,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:29:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 565. [2019-10-13 21:29:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-13 21:29:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 735 transitions. [2019-10-13 21:29:10,155 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 735 transitions. Word has length 82 [2019-10-13 21:29:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 735 transitions. [2019-10-13 21:29:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 735 transitions. [2019-10-13 21:29:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:29:10,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,159 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1148563485, now seen corresponding path program 1 times [2019-10-13 21:29:10,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102184806] [2019-10-13 21:29:10,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102184806] [2019-10-13 21:29:10,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452411956] [2019-10-13 21:29:10,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,294 INFO L87 Difference]: Start difference. First operand 565 states and 735 transitions. Second operand 6 states. [2019-10-13 21:29:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,381 INFO L93 Difference]: Finished difference Result 1129 states and 1502 transitions. [2019-10-13 21:29:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:10,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-13 21:29:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,391 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:29:10,391 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:29:10,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:29:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2019-10-13 21:29:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-13 21:29:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 743 transitions. [2019-10-13 21:29:10,446 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 743 transitions. Word has length 83 [2019-10-13 21:29:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,447 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 743 transitions. [2019-10-13 21:29:10,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 743 transitions. [2019-10-13 21:29:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:29:10,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,449 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash -223243813, now seen corresponding path program 1 times [2019-10-13 21:29:10,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519008972] [2019-10-13 21:29:10,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519008972] [2019-10-13 21:29:10,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:10,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086194312] [2019-10-13 21:29:10,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:10,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:10,577 INFO L87 Difference]: Start difference. First operand 575 states and 743 transitions. Second operand 6 states. [2019-10-13 21:29:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:10,722 INFO L93 Difference]: Finished difference Result 1504 states and 1996 transitions. [2019-10-13 21:29:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:29:10,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-13 21:29:10,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:10,731 INFO L225 Difference]: With dead ends: 1504 [2019-10-13 21:29:10,731 INFO L226 Difference]: Without dead ends: 951 [2019-10-13 21:29:10,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:10,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-10-13 21:29:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2019-10-13 21:29:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-10-13 21:29:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1213 transitions. [2019-10-13 21:29:10,797 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1213 transitions. Word has length 83 [2019-10-13 21:29:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:10,798 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1213 transitions. [2019-10-13 21:29:10,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1213 transitions. [2019-10-13 21:29:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:29:10,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:10,801 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:10,801 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1894736262, now seen corresponding path program 1 times [2019-10-13 21:29:10,802 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:10,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538525945] [2019-10-13 21:29:10,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:10,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:10,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538525945] [2019-10-13 21:29:10,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:10,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:29:10,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653754969] [2019-10-13 21:29:10,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:29:10,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:29:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:10,986 INFO L87 Difference]: Start difference. First operand 927 states and 1213 transitions. Second operand 8 states. [2019-10-13 21:29:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:12,680 INFO L93 Difference]: Finished difference Result 2914 states and 4213 transitions. [2019-10-13 21:29:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:29:12,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-10-13 21:29:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:12,702 INFO L225 Difference]: With dead ends: 2914 [2019-10-13 21:29:12,702 INFO L226 Difference]: Without dead ends: 2131 [2019-10-13 21:29:12,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:29:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2019-10-13 21:29:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2014. [2019-10-13 21:29:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-10-13 21:29:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2850 transitions. [2019-10-13 21:29:12,913 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2850 transitions. Word has length 96 [2019-10-13 21:29:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:12,914 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 2850 transitions. [2019-10-13 21:29:12,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:29:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2850 transitions. [2019-10-13 21:29:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 21:29:12,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:12,917 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:12,917 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:12,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1165049387, now seen corresponding path program 1 times [2019-10-13 21:29:12,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:12,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670377819] [2019-10-13 21:29:12,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:12,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:13,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670377819] [2019-10-13 21:29:13,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:13,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:29:13,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600327222] [2019-10-13 21:29:13,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:29:13,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:29:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:13,210 INFO L87 Difference]: Start difference. First operand 2014 states and 2850 transitions. Second operand 9 states. [2019-10-13 21:29:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,171 INFO L93 Difference]: Finished difference Result 2322 states and 3502 transitions. [2019-10-13 21:29:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:29:15,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-10-13 21:29:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,199 INFO L225 Difference]: With dead ends: 2322 [2019-10-13 21:29:15,199 INFO L226 Difference]: Without dead ends: 2319 [2019-10-13 21:29:15,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:29:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2019-10-13 21:29:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2118. [2019-10-13 21:29:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2019-10-13 21:29:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3079 transitions. [2019-10-13 21:29:15,360 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3079 transitions. Word has length 101 [2019-10-13 21:29:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:15,362 INFO L462 AbstractCegarLoop]: Abstraction has 2118 states and 3079 transitions. [2019-10-13 21:29:15,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:29:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3079 transitions. [2019-10-13 21:29:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:29:15,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:15,364 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:15,365 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1774230569, now seen corresponding path program 1 times [2019-10-13 21:29:15,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:15,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475040123] [2019-10-13 21:29:15,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:15,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475040123] [2019-10-13 21:29:15,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507006680] [2019-10-13 21:29:15,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:15,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:29:15,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:15,638 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:15,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:15,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-10-13 21:29:15,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194164142] [2019-10-13 21:29:15,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:15,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:15,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:15,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:15,732 INFO L87 Difference]: Start difference. First operand 2118 states and 3079 transitions. Second operand 3 states. [2019-10-13 21:29:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:15,942 INFO L93 Difference]: Finished difference Result 6100 states and 9810 transitions. [2019-10-13 21:29:15,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:15,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-13 21:29:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:15,977 INFO L225 Difference]: With dead ends: 6100 [2019-10-13 21:29:15,977 INFO L226 Difference]: Without dead ends: 4004 [2019-10-13 21:29:15,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:29:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2019-10-13 21:29:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 3999. [2019-10-13 21:29:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3999 states. [2019-10-13 21:29:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 6242 transitions. [2019-10-13 21:29:16,380 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 6242 transitions. Word has length 104 [2019-10-13 21:29:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 3999 states and 6242 transitions. [2019-10-13 21:29:16,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 6242 transitions. [2019-10-13 21:29:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:16,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:16,387 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:16,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:16,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1959447637, now seen corresponding path program 1 times [2019-10-13 21:29:16,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:16,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201959155] [2019-10-13 21:29:16,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,595 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:16,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:29:16,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201959155] [2019-10-13 21:29:16,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:16,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:16,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037951059] [2019-10-13 21:29:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:16,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:16,637 INFO L87 Difference]: Start difference. First operand 3999 states and 6242 transitions. Second operand 4 states. [2019-10-13 21:29:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:16,938 INFO L93 Difference]: Finished difference Result 7970 states and 12444 transitions. [2019-10-13 21:29:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:16,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:29:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:16,973 INFO L225 Difference]: With dead ends: 7970 [2019-10-13 21:29:16,973 INFO L226 Difference]: Without dead ends: 3992 [2019-10-13 21:29:17,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2019-10-13 21:29:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3992. [2019-10-13 21:29:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2019-10-13 21:29:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 6228 transitions. [2019-10-13 21:29:17,294 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 6228 transitions. Word has length 106 [2019-10-13 21:29:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:17,295 INFO L462 AbstractCegarLoop]: Abstraction has 3992 states and 6228 transitions. [2019-10-13 21:29:17,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 6228 transitions. [2019-10-13 21:29:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:29:17,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:17,299 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:17,299 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 535357227, now seen corresponding path program 1 times [2019-10-13 21:29:17,300 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:17,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364880153] [2019-10-13 21:29:17,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,301 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:17,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:17,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364880153] [2019-10-13 21:29:17,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115372777] [2019-10-13 21:29:17,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:17,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:17,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:17,653 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:29:17,725 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:17,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-13 21:29:17,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943948726] [2019-10-13 21:29:17,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:17,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:17,727 INFO L87 Difference]: Start difference. First operand 3992 states and 6228 transitions. Second operand 4 states. [2019-10-13 21:29:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:18,404 INFO L93 Difference]: Finished difference Result 11239 states and 19517 transitions. [2019-10-13 21:29:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:18,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:29:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:18,489 INFO L225 Difference]: With dead ends: 11239 [2019-10-13 21:29:18,490 INFO L226 Difference]: Without dead ends: 7269 [2019-10-13 21:29:18,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-10-13 21:29:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 7264. [2019-10-13 21:29:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7264 states. [2019-10-13 21:29:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 11651 transitions. [2019-10-13 21:29:19,200 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 11651 transitions. Word has length 106 [2019-10-13 21:29:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:19,201 INFO L462 AbstractCegarLoop]: Abstraction has 7264 states and 11651 transitions. [2019-10-13 21:29:19,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 11651 transitions. [2019-10-13 21:29:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:29:19,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:19,208 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:19,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:19,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash -719656318, now seen corresponding path program 1 times [2019-10-13 21:29:19,419 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:19,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548143297] [2019-10-13 21:29:19,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:19,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:29:19,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548143297] [2019-10-13 21:29:19,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:19,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:29:19,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127552640] [2019-10-13 21:29:19,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:29:19,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:29:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:19,528 INFO L87 Difference]: Start difference. First operand 7264 states and 11651 transitions. Second operand 7 states. [2019-10-13 21:29:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:20,786 INFO L93 Difference]: Finished difference Result 18690 states and 31816 transitions. [2019-10-13 21:29:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:29:20,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-10-13 21:29:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:20,879 INFO L225 Difference]: With dead ends: 18690 [2019-10-13 21:29:20,880 INFO L226 Difference]: Without dead ends: 11807 [2019-10-13 21:29:20,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:29:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11807 states. [2019-10-13 21:29:22,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11807 to 11665. [2019-10-13 21:29:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11665 states. [2019-10-13 21:29:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11665 states to 11665 states and 18163 transitions. [2019-10-13 21:29:22,362 INFO L78 Accepts]: Start accepts. Automaton has 11665 states and 18163 transitions. Word has length 112 [2019-10-13 21:29:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:22,363 INFO L462 AbstractCegarLoop]: Abstraction has 11665 states and 18163 transitions. [2019-10-13 21:29:22,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:29:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 11665 states and 18163 transitions. [2019-10-13 21:29:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:29:22,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:22,369 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:22,369 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:22,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1217934684, now seen corresponding path program 1 times [2019-10-13 21:29:22,370 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:22,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040764509] [2019-10-13 21:29:22,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:22,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:29:22,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040764509] [2019-10-13 21:29:22,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:22,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:29:22,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832994164] [2019-10-13 21:29:22,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:29:22,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:29:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:22,503 INFO L87 Difference]: Start difference. First operand 11665 states and 18163 transitions. Second operand 8 states. [2019-10-13 21:29:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:23,824 INFO L93 Difference]: Finished difference Result 26321 states and 42898 transitions. [2019-10-13 21:29:23,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:29:23,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 116 [2019-10-13 21:29:23,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:23,907 INFO L225 Difference]: With dead ends: 26321 [2019-10-13 21:29:23,907 INFO L226 Difference]: Without dead ends: 12925 [2019-10-13 21:29:23,959 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:29:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12925 states. [2019-10-13 21:29:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12925 to 12705. [2019-10-13 21:29:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12705 states. [2019-10-13 21:29:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12705 states to 12705 states and 20517 transitions. [2019-10-13 21:29:24,917 INFO L78 Accepts]: Start accepts. Automaton has 12705 states and 20517 transitions. Word has length 116 [2019-10-13 21:29:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:24,920 INFO L462 AbstractCegarLoop]: Abstraction has 12705 states and 20517 transitions. [2019-10-13 21:29:24,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:29:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 12705 states and 20517 transitions. [2019-10-13 21:29:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:29:24,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:24,927 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:24,927 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1456232897, now seen corresponding path program 1 times [2019-10-13 21:29:24,928 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:24,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333827306] [2019-10-13 21:29:24,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:24,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:25,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333827306] [2019-10-13 21:29:25,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183033986] [2019-10-13 21:29:25,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:25,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:25,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:29:25,175 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:29:25,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:29:25,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2019-10-13 21:29:25,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356070374] [2019-10-13 21:29:25,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:29:25,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:29:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:25,262 INFO L87 Difference]: Start difference. First operand 12705 states and 20517 transitions. Second operand 3 states. [2019-10-13 21:29:25,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:25,965 INFO L93 Difference]: Finished difference Result 25098 states and 42951 transitions. [2019-10-13 21:29:25,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:29:25,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-13 21:29:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:26,047 INFO L225 Difference]: With dead ends: 25098 [2019-10-13 21:29:26,048 INFO L226 Difference]: Without dead ends: 12420 [2019-10-13 21:29:26,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:29:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-10-13 21:29:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 12414. [2019-10-13 21:29:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12414 states. [2019-10-13 21:29:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12414 states to 12414 states and 18928 transitions. [2019-10-13 21:29:27,075 INFO L78 Accepts]: Start accepts. Automaton has 12414 states and 18928 transitions. Word has length 121 [2019-10-13 21:29:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:27,075 INFO L462 AbstractCegarLoop]: Abstraction has 12414 states and 18928 transitions. [2019-10-13 21:29:27,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:29:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12414 states and 18928 transitions. [2019-10-13 21:29:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 21:29:27,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:27,084 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:27,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:27,290 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:27,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1440725386, now seen corresponding path program 1 times [2019-10-13 21:29:27,291 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:27,291 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119339805] [2019-10-13 21:29:27,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:27,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:27,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119339805] [2019-10-13 21:29:27,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:27,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:29:27,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884743982] [2019-10-13 21:29:27,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:29:27,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:27,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:29:27,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:29:27,378 INFO L87 Difference]: Start difference. First operand 12414 states and 18928 transitions. Second operand 8 states. [2019-10-13 21:29:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:33,242 INFO L93 Difference]: Finished difference Result 48202 states and 84998 transitions. [2019-10-13 21:29:33,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:29:33,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-10-13 21:29:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:33,459 INFO L225 Difference]: With dead ends: 48202 [2019-10-13 21:29:33,460 INFO L226 Difference]: Without dead ends: 34108 [2019-10-13 21:29:33,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:29:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34108 states. [2019-10-13 21:29:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34108 to 32598. [2019-10-13 21:29:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32598 states. [2019-10-13 21:29:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32598 states to 32598 states and 54458 transitions. [2019-10-13 21:29:35,667 INFO L78 Accepts]: Start accepts. Automaton has 32598 states and 54458 transitions. Word has length 125 [2019-10-13 21:29:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:35,668 INFO L462 AbstractCegarLoop]: Abstraction has 32598 states and 54458 transitions. [2019-10-13 21:29:35,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:29:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 32598 states and 54458 transitions. [2019-10-13 21:29:35,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 21:29:35,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:35,677 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:29:35,677 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 109681911, now seen corresponding path program 1 times [2019-10-13 21:29:35,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:35,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870908653] [2019-10-13 21:29:35,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:29:35,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870908653] [2019-10-13 21:29:35,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510637367] [2019-10-13 21:29:35,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:29:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:35,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:29:35,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:29:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:29:35,916 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:29:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:29:36,004 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:29:36,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-13 21:29:36,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181163489] [2019-10-13 21:29:36,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:36,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:36,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:29:36,008 INFO L87 Difference]: Start difference. First operand 32598 states and 54458 transitions. Second operand 4 states.