java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:31:23,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:31:23,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:31:23,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:31:23,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:31:23,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:31:23,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:31:23,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:31:23,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:31:23,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:31:23,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:31:23,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:31:23,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:31:23,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:31:23,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:31:23,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:31:23,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:31:23,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:31:23,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:31:23,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:31:23,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:31:23,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:31:23,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:31:23,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:31:23,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:31:23,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:31:23,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:31:23,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:31:23,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:31:23,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:31:23,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:31:23,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:31:23,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:31:23,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:31:23,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:31:23,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:31:23,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:31:23,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:31:23,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:31:23,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:31:23,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:31:23,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:31:23,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:31:23,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:31:23,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:31:23,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:31:23,965 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:31:23,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:31:23,966 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:31:23,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:31:23,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:31:23,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:31:23,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:31:23,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:31:23,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:31:23,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:31:23,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:31:23,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:31:23,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:31:23,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:31:23,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:31:23,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:31:23,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:31:23,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:23,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:31:23,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:31:23,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:31:23,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:31:23,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:31:23,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:31:23,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:31:24,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:31:24,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:31:24,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:31:24,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:31:24,275 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:31:24,275 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-15 03:31:24,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac71006a/286057cd257a4eeda9e5bf31381c71d8/FLAG9ccb9a656 [2019-10-15 03:31:24,858 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:31:24,859 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-15 03:31:24,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac71006a/286057cd257a4eeda9e5bf31381c71d8/FLAG9ccb9a656 [2019-10-15 03:31:25,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac71006a/286057cd257a4eeda9e5bf31381c71d8 [2019-10-15 03:31:25,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:31:25,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:31:25,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:25,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:31:25,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:31:25,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d678107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25, skipping insertion in model container [2019-10-15 03:31:25,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,291 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:31:25,324 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:31:25,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:25,559 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:31:25,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:31:25,732 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:31:25,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25 WrapperNode [2019-10-15 03:31:25,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:31:25,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:31:25,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:31:25,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:31:25,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... [2019-10-15 03:31:25,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:31:25,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:31:25,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:31:25,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:31:25,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:31:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:31:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-15 03:31:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-15 03:31:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-15 03:31:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 03:31:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 03:31:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 03:31:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-15 03:31:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 03:31:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 03:31:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 03:31:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:31:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:31:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-15 03:31:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 03:31:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 03:31:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 03:31:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 03:31:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:31:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:31:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:31:26,545 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:31:26,545 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 03:31:26,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:26 BoogieIcfgContainer [2019-10-15 03:31:26,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:31:26,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:31:26,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:31:26,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:31:26,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:31:25" (1/3) ... [2019-10-15 03:31:26,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fc4530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:26, skipping insertion in model container [2019-10-15 03:31:26,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:31:25" (2/3) ... [2019-10-15 03:31:26,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fc4530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:31:26, skipping insertion in model container [2019-10-15 03:31:26,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:31:26" (3/3) ... [2019-10-15 03:31:26,564 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-15 03:31:26,579 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:31:26,589 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:31:26,601 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:31:26,634 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:31:26,634 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:31:26,634 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:31:26,634 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:31:26,634 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:31:26,635 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:31:26,635 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:31:26,635 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:31:26,654 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-15 03:31:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:31:26,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:26,663 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] [2019-10-15 03:31:26,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:26,669 INFO L82 PathProgramCache]: Analyzing trace with hash 68690287, now seen corresponding path program 1 times [2019-10-15 03:31:26,677 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:26,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893558687] [2019-10-15 03:31:26,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:26,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:26,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893558687] [2019-10-15 03:31:26,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:26,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:26,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763323259] [2019-10-15 03:31:27,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:27,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:27,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:27,019 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-10-15 03:31:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:27,402 INFO L93 Difference]: Finished difference Result 331 states and 443 transitions. [2019-10-15 03:31:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:27,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-15 03:31:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:27,421 INFO L225 Difference]: With dead ends: 331 [2019-10-15 03:31:27,421 INFO L226 Difference]: Without dead ends: 212 [2019-10-15 03:31:27,428 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-15 03:31:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-15 03:31:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2019-10-15 03:31:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-15 03:31:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2019-10-15 03:31:27,572 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 59 [2019-10-15 03:31:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:27,574 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2019-10-15 03:31:27,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2019-10-15 03:31:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:31:27,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:27,583 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] [2019-10-15 03:31:27,584 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1696126322, now seen corresponding path program 1 times [2019-10-15 03:31:27,585 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:27,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331904360] [2019-10-15 03:31:27,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:27,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:27,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331904360] [2019-10-15 03:31:27,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:27,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:27,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053031827] [2019-10-15 03:31:27,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:27,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:27,761 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand 4 states. [2019-10-15 03:31:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,031 INFO L93 Difference]: Finished difference Result 559 states and 725 transitions. [2019-10-15 03:31:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:28,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-15 03:31:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,037 INFO L225 Difference]: With dead ends: 559 [2019-10-15 03:31:28,037 INFO L226 Difference]: Without dead ends: 375 [2019-10-15 03:31:28,041 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-15 03:31:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-15 03:31:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2019-10-15 03:31:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 03:31:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 431 transitions. [2019-10-15 03:31:28,091 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 431 transitions. Word has length 59 [2019-10-15 03:31:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,093 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 431 transitions. [2019-10-15 03:31:28,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 431 transitions. [2019-10-15 03:31:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:31:28,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,095 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] [2019-10-15 03:31:28,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 321226243, now seen corresponding path program 1 times [2019-10-15 03:31:28,098 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27751257] [2019-10-15 03:31:28,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,098 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:28,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27751257] [2019-10-15 03:31:28,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:28,195 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:28,195 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044428238] [2019-10-15 03:31:28,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:28,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:28,196 INFO L87 Difference]: Start difference. First operand 352 states and 431 transitions. Second operand 4 states. [2019-10-15 03:31:28,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,495 INFO L93 Difference]: Finished difference Result 867 states and 1105 transitions. [2019-10-15 03:31:28,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:28,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-15 03:31:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,501 INFO L225 Difference]: With dead ends: 867 [2019-10-15 03:31:28,501 INFO L226 Difference]: Without dead ends: 531 [2019-10-15 03:31:28,503 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-15 03:31:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-15 03:31:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 506. [2019-10-15 03:31:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-15 03:31:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 620 transitions. [2019-10-15 03:31:28,554 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 620 transitions. Word has length 60 [2019-10-15 03:31:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,557 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 620 transitions. [2019-10-15 03:31:28,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 620 transitions. [2019-10-15 03:31:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:31:28,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,561 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] [2019-10-15 03:31:28,561 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash -650448444, now seen corresponding path program 1 times [2019-10-15 03:31:28,562 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478448313] [2019-10-15 03:31:28,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:28,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478448313] [2019-10-15 03:31:28,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:28,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:31:28,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631234217] [2019-10-15 03:31:28,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:31:28,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:31:28,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:28,726 INFO L87 Difference]: Start difference. First operand 506 states and 620 transitions. Second operand 6 states. [2019-10-15 03:31:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:28,865 INFO L93 Difference]: Finished difference Result 1015 states and 1266 transitions. [2019-10-15 03:31:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:31:28,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-15 03:31:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:28,871 INFO L225 Difference]: With dead ends: 1015 [2019-10-15 03:31:28,871 INFO L226 Difference]: Without dead ends: 599 [2019-10-15 03:31:28,874 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-15 03:31:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-15 03:31:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 585. [2019-10-15 03:31:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 03:31:28,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 719 transitions. [2019-10-15 03:31:28,919 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 719 transitions. Word has length 60 [2019-10-15 03:31:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:28,919 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 719 transitions. [2019-10-15 03:31:28,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:31:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 719 transitions. [2019-10-15 03:31:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-15 03:31:28,922 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:28,922 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] [2019-10-15 03:31:28,922 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1879581246, now seen corresponding path program 1 times [2019-10-15 03:31:28,923 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:28,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098053273] [2019-10-15 03:31:28,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:28,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:29,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098053273] [2019-10-15 03:31:29,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:29,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:31:29,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614514618] [2019-10-15 03:31:29,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:31:29,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:31:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:31:29,063 INFO L87 Difference]: Start difference. First operand 585 states and 719 transitions. Second operand 6 states. [2019-10-15 03:31:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:29,755 INFO L93 Difference]: Finished difference Result 1086 states and 1467 transitions. [2019-10-15 03:31:29,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:31:29,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-15 03:31:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:29,762 INFO L225 Difference]: With dead ends: 1086 [2019-10-15 03:31:29,762 INFO L226 Difference]: Without dead ends: 835 [2019-10-15 03:31:29,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-10-15 03:31:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 781. [2019-10-15 03:31:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-15 03:31:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1032 transitions. [2019-10-15 03:31:29,848 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1032 transitions. Word has length 73 [2019-10-15 03:31:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:29,850 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1032 transitions. [2019-10-15 03:31:29,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:31:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1032 transitions. [2019-10-15 03:31:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-15 03:31:29,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:29,856 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] [2019-10-15 03:31:29,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1269060783, now seen corresponding path program 1 times [2019-10-15 03:31:29,866 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:29,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136022783] [2019-10-15 03:31:29,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,867 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:30,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:30,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136022783] [2019-10-15 03:31:30,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:30,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:31:30,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083619484] [2019-10-15 03:31:30,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:31:30,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:31:30,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:30,065 INFO L87 Difference]: Start difference. First operand 781 states and 1032 transitions. Second operand 9 states. [2019-10-15 03:31:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:31,361 INFO L93 Difference]: Finished difference Result 1790 states and 2639 transitions. [2019-10-15 03:31:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:31:31,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-10-15 03:31:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:31,373 INFO L225 Difference]: With dead ends: 1790 [2019-10-15 03:31:31,373 INFO L226 Difference]: Without dead ends: 1382 [2019-10-15 03:31:31,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:31:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-10-15 03:31:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1255. [2019-10-15 03:31:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-10-15 03:31:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1765 transitions. [2019-10-15 03:31:31,491 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1765 transitions. Word has length 77 [2019-10-15 03:31:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:31,491 INFO L462 AbstractCegarLoop]: Abstraction has 1255 states and 1765 transitions. [2019-10-15 03:31:31,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:31:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1765 transitions. [2019-10-15 03:31:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-15 03:31:31,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:31,494 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:31,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:31,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1025383731, now seen corresponding path program 1 times [2019-10-15 03:31:31,495 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:31,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089642457] [2019-10-15 03:31:31,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:31,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:31,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089642457] [2019-10-15 03:31:31,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952977357] [2019-10-15 03:31:31,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:31,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:31,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:31,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:31,955 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:31,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-15 03:31:31,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176561467] [2019-10-15 03:31:31,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:31,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:31,959 INFO L87 Difference]: Start difference. First operand 1255 states and 1765 transitions. Second operand 4 states. [2019-10-15 03:31:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:32,127 INFO L93 Difference]: Finished difference Result 3044 states and 4222 transitions. [2019-10-15 03:31:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:32,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-15 03:31:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:32,145 INFO L225 Difference]: With dead ends: 3044 [2019-10-15 03:31:32,145 INFO L226 Difference]: Without dead ends: 1806 [2019-10-15 03:31:32,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:31:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-10-15 03:31:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1465. [2019-10-15 03:31:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-10-15 03:31:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1930 transitions. [2019-10-15 03:31:32,348 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1930 transitions. Word has length 76 [2019-10-15 03:31:32,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:32,349 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1930 transitions. [2019-10-15 03:31:32,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1930 transitions. [2019-10-15 03:31:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:31:32,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:32,353 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 03:31:32,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:32,557 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:32,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:32,558 INFO L82 PathProgramCache]: Analyzing trace with hash 550466613, now seen corresponding path program 1 times [2019-10-15 03:31:32,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:32,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432579455] [2019-10-15 03:31:32,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:32,559 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:32,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:32,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432579455] [2019-10-15 03:31:32,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116023268] [2019-10-15 03:31:32,716 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-15 03:31:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:32,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:31:32,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:31:32,911 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 03:31:33,006 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:31:33,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2019-10-15 03:31:33,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387881488] [2019-10-15 03:31:33,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:33,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:33,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:33,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:31:33,013 INFO L87 Difference]: Start difference. First operand 1465 states and 1930 transitions. Second operand 4 states. [2019-10-15 03:31:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:33,191 INFO L93 Difference]: Finished difference Result 3383 states and 4415 transitions. [2019-10-15 03:31:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:33,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-15 03:31:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:33,207 INFO L225 Difference]: With dead ends: 3383 [2019-10-15 03:31:33,208 INFO L226 Difference]: Without dead ends: 1935 [2019-10-15 03:31:33,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:31:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-10-15 03:31:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1674. [2019-10-15 03:31:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-15 03:31:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2093 transitions. [2019-10-15 03:31:33,351 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2093 transitions. Word has length 80 [2019-10-15 03:31:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:33,352 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2093 transitions. [2019-10-15 03:31:33,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2093 transitions. [2019-10-15 03:31:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 03:31:33,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:33,359 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:33,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:33,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1858550324, now seen corresponding path program 1 times [2019-10-15 03:31:33,566 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:33,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193067429] [2019-10-15 03:31:33,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:33,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-15 03:31:33,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193067429] [2019-10-15 03:31:33,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:33,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:33,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572006980] [2019-10-15 03:31:33,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:33,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:33,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:33,700 INFO L87 Difference]: Start difference. First operand 1674 states and 2093 transitions. Second operand 4 states. [2019-10-15 03:31:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:33,907 INFO L93 Difference]: Finished difference Result 2918 states and 3658 transitions. [2019-10-15 03:31:33,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:31:33,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-15 03:31:33,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:33,918 INFO L225 Difference]: With dead ends: 2918 [2019-10-15 03:31:33,918 INFO L226 Difference]: Without dead ends: 1674 [2019-10-15 03:31:33,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-10-15 03:31:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2019-10-15 03:31:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-15 03:31:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2089 transitions. [2019-10-15 03:31:34,038 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2089 transitions. Word has length 129 [2019-10-15 03:31:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:34,039 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2089 transitions. [2019-10-15 03:31:34,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2089 transitions. [2019-10-15 03:31:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 03:31:34,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:34,042 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:34,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1602685328, now seen corresponding path program 1 times [2019-10-15 03:31:34,043 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:34,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187626594] [2019-10-15 03:31:34,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:34,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:34,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 03:31:34,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187626594] [2019-10-15 03:31:34,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209820607] [2019-10-15 03:31:34,183 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-15 03:31:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:34,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-15 03:31:34,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:31:34,478 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:34,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:34,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:34,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:34,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-15 03:31:34,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:34,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-10-15 03:31:34,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117675402] [2019-10-15 03:31:34,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:31:34,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:31:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-15 03:31:34,845 INFO L87 Difference]: Start difference. First operand 1674 states and 2089 transitions. Second operand 11 states. [2019-10-15 03:31:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:36,378 INFO L93 Difference]: Finished difference Result 4988 states and 6359 transitions. [2019-10-15 03:31:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 03:31:36,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2019-10-15 03:31:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:36,401 INFO L225 Difference]: With dead ends: 4988 [2019-10-15 03:31:36,401 INFO L226 Difference]: Without dead ends: 3331 [2019-10-15 03:31:36,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 03:31:36,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-10-15 03:31:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3281. [2019-10-15 03:31:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-10-15 03:31:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4012 transitions. [2019-10-15 03:31:36,663 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4012 transitions. Word has length 131 [2019-10-15 03:31:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:36,663 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 4012 transitions. [2019-10-15 03:31:36,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:31:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4012 transitions. [2019-10-15 03:31:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-15 03:31:36,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:36,667 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:36,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:36,872 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1977951621, now seen corresponding path program 1 times [2019-10-15 03:31:36,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:36,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637742957] [2019-10-15 03:31:36,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:36,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:36,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-15 03:31:36,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637742957] [2019-10-15 03:31:36,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:31:36,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:31:36,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197232215] [2019-10-15 03:31:36,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:31:36,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:31:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:36,948 INFO L87 Difference]: Start difference. First operand 3281 states and 4012 transitions. Second operand 4 states. [2019-10-15 03:31:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:37,276 INFO L93 Difference]: Finished difference Result 6251 states and 7657 transitions. [2019-10-15 03:31:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:31:37,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-15 03:31:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:37,301 INFO L225 Difference]: With dead ends: 6251 [2019-10-15 03:31:37,301 INFO L226 Difference]: Without dead ends: 3671 [2019-10-15 03:31:37,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:31:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-10-15 03:31:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3572. [2019-10-15 03:31:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-10-15 03:31:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4217 transitions. [2019-10-15 03:31:37,572 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4217 transitions. Word has length 134 [2019-10-15 03:31:37,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:37,575 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4217 transitions. [2019-10-15 03:31:37,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:31:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4217 transitions. [2019-10-15 03:31:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:31:37,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:37,580 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:37,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1810490110, now seen corresponding path program 1 times [2019-10-15 03:31:37,581 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:37,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930214544] [2019-10-15 03:31:37,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:37,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:37,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 03:31:37,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930214544] [2019-10-15 03:31:37,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597177002] [2019-10-15 03:31:37,714 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-15 03:31:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:37,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:31:37,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:37,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:37,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:31:37,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:38,344 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-10-15 03:31:38,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:31:38,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:38,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:38,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 03:31:38,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:38,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 16 [2019-10-15 03:31:38,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474914597] [2019-10-15 03:31:38,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:31:38,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:38,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:31:38,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:31:38,447 INFO L87 Difference]: Start difference. First operand 3572 states and 4217 transitions. Second operand 6 states. [2019-10-15 03:31:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:38,709 INFO L93 Difference]: Finished difference Result 6488 states and 7811 transitions. [2019-10-15 03:31:38,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:31:38,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-15 03:31:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:38,729 INFO L225 Difference]: With dead ends: 6488 [2019-10-15 03:31:38,729 INFO L226 Difference]: Without dead ends: 2933 [2019-10-15 03:31:38,742 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 262 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:31:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-10-15 03:31:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2645. [2019-10-15 03:31:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-10-15 03:31:38,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3102 transitions. [2019-10-15 03:31:38,964 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3102 transitions. Word has length 133 [2019-10-15 03:31:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:38,965 INFO L462 AbstractCegarLoop]: Abstraction has 2645 states and 3102 transitions. [2019-10-15 03:31:38,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:31:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3102 transitions. [2019-10-15 03:31:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 03:31:38,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:38,968 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:39,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:39,176 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:39,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1820360425, now seen corresponding path program 1 times [2019-10-15 03:31:39,178 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:39,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69696650] [2019-10-15 03:31:39,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:39,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:39,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 03:31:39,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69696650] [2019-10-15 03:31:39,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222481328] [2019-10-15 03:31:39,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:39,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 03:31:39,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:31:39,632 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:39,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 03:31:39,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:31:39,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-15 03:31:39,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471335724] [2019-10-15 03:31:39,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:31:39,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:31:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:31:39,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:31:39,819 INFO L87 Difference]: Start difference. First operand 2645 states and 3102 transitions. Second operand 6 states. [2019-10-15 03:31:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:31:40,533 INFO L93 Difference]: Finished difference Result 5301 states and 6274 transitions. [2019-10-15 03:31:40,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:31:40,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-15 03:31:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:31:40,548 INFO L225 Difference]: With dead ends: 5301 [2019-10-15 03:31:40,548 INFO L226 Difference]: Without dead ends: 2218 [2019-10-15 03:31:40,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:31:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-10-15 03:31:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2143. [2019-10-15 03:31:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2019-10-15 03:31:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 2450 transitions. [2019-10-15 03:31:40,729 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 2450 transitions. Word has length 137 [2019-10-15 03:31:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:31:40,730 INFO L462 AbstractCegarLoop]: Abstraction has 2143 states and 2450 transitions. [2019-10-15 03:31:40,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:31:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2450 transitions. [2019-10-15 03:31:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 03:31:40,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:31:40,735 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:31:40,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:40,940 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:31:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:31:40,941 INFO L82 PathProgramCache]: Analyzing trace with hash 112536929, now seen corresponding path program 1 times [2019-10-15 03:31:40,941 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:31:40,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173572786] [2019-10-15 03:31:40,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:40,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:31:40,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:31:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 03:31:41,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173572786] [2019-10-15 03:31:41,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232810571] [2019-10-15 03:31:41,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:31:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:31:41,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-15 03:31:41,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:31:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 03:31:41,534 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:31:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:41,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:41,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:31:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 03:31:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [193032385] [2019-10-15 03:31:41,850 INFO L162 IcfgInterpreter]: Started Sifa with 90 locations of interest [2019-10-15 03:31:41,850 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:31:41,856 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:31:41,864 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:31:41,864 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:31:42,087 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 49 for LOIs [2019-10-15 03:31:42,122 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 82 for LOIs [2019-10-15 03:31:42,672 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 47 for LOIs [2019-10-15 03:31:42,741 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 84 for LOIs