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-f4eb214f-m [2019-10-13 23:26:38,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:26:38,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:26:38,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:26:38,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:26:38,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:26:38,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:26:38,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:26:38,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:26:39,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:26:39,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:26:39,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:26:39,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:26:39,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:26:39,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:26:39,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:26:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:26:39,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:26:39,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:26:39,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:26:39,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:26:39,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:26:39,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:26:39,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:26:39,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:26:39,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:26:39,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:26:39,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:26:39,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:26:39,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:26:39,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:26:39,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:26:39,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:26:39,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:26:39,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:26:39,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:26:39,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:26:39,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:26:39,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:26:39,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:26:39,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:26:39,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:26:39,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:26:39,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:26:39,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:26:39,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:26:39,087 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:26:39,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:26:39,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:26:39,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:26:39,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:26:39,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:26:39,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:26:39,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:26:39,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:26:39,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:26:39,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:26:39,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:26:39,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:26:39,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:26:39,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:26:39,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:26:39,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:26:39,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:26:39,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:26:39,092 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-13 23:26:39,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:26:39,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:26:39,400 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:26:39,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:26:39,402 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:26:39,402 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-13 23:26:39,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd39d4461/0f5cc5a1da594983be052b5c43c95bbf/FLAG46952fa7a [2019-10-13 23:26:39,945 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:26:39,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-10-13 23:26:39,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd39d4461/0f5cc5a1da594983be052b5c43c95bbf/FLAG46952fa7a [2019-10-13 23:26:40,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd39d4461/0f5cc5a1da594983be052b5c43c95bbf [2019-10-13 23:26:40,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:26:40,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:26:40,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:26:40,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:26:40,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:26:40,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6912290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40, skipping insertion in model container [2019-10-13 23:26:40,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,316 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:26:40,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:26:40,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:26:40,592 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:26:40,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:26:40,748 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:26:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40 WrapperNode [2019-10-13 23:26:40,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:26:40,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:26:40,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:26:40,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:26:40,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,776 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... [2019-10-13 23:26:40,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:26:40,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:26:40,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:26:40,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:26:40,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:26:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:26:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:26:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 23:26:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-13 23:26:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-13 23:26:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-13 23:26:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-13 23:26:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 23:26:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 23:26:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 23:26:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 23:26:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 23:26:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:26:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:26:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:26:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-13 23:26:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 23:26:40,867 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 23:26:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 23:26:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 23:26:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 23:26:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 23:26:40,868 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 23:26:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 23:26:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 23:26:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:26:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:26:40,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:26:41,560 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:26:41,560 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 23:26:41,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:26:41 BoogieIcfgContainer [2019-10-13 23:26:41,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:26:41,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:26:41,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:26:41,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:26:41,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:26:40" (1/3) ... [2019-10-13 23:26:41,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85859b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:26:41, skipping insertion in model container [2019-10-13 23:26:41,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:26:40" (2/3) ... [2019-10-13 23:26:41,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85859b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:26:41, skipping insertion in model container [2019-10-13 23:26:41,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:26:41" (3/3) ... [2019-10-13 23:26:41,583 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-10-13 23:26:41,593 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:26:41,600 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:26:41,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:26:41,638 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:26:41,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:26:41,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:26:41,639 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:26:41,639 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:26:41,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:26:41,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:26:41,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:26:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-13 23:26:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:26:41,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:41,672 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-13 23:26:41,674 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash 68690287, now seen corresponding path program 1 times [2019-10-13 23:26:41,686 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:41,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525061063] [2019-10-13 23:26:41,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:41,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:41,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:42,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525061063] [2019-10-13 23:26:42,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:42,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:26:42,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388153786] [2019-10-13 23:26:42,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:42,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:42,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:42,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:42,039 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 4 states. [2019-10-13 23:26:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:42,405 INFO L93 Difference]: Finished difference Result 331 states and 443 transitions. [2019-10-13 23:26:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:42,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-13 23:26:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:42,423 INFO L225 Difference]: With dead ends: 331 [2019-10-13 23:26:42,424 INFO L226 Difference]: Without dead ends: 212 [2019-10-13 23:26:42,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-13 23:26:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2019-10-13 23:26:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-13 23:26:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2019-10-13 23:26:42,509 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 59 [2019-10-13 23:26:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:42,510 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2019-10-13 23:26:42,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2019-10-13 23:26:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:26:42,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:42,513 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-13 23:26:42,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1696126322, now seen corresponding path program 1 times [2019-10-13 23:26:42,515 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:42,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137483408] [2019-10-13 23:26:42,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:42,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:42,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:42,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137483408] [2019-10-13 23:26:42,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:42,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:26:42,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595202989] [2019-10-13 23:26:42,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:42,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:42,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:42,668 INFO L87 Difference]: Start difference. First operand 200 states and 250 transitions. Second operand 4 states. [2019-10-13 23:26:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:42,959 INFO L93 Difference]: Finished difference Result 559 states and 725 transitions. [2019-10-13 23:26:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:42,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-13 23:26:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:42,965 INFO L225 Difference]: With dead ends: 559 [2019-10-13 23:26:42,966 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 23:26:42,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 23:26:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 352. [2019-10-13 23:26:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-13 23:26:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 431 transitions. [2019-10-13 23:26:43,058 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 431 transitions. Word has length 59 [2019-10-13 23:26:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:43,059 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 431 transitions. [2019-10-13 23:26:43,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 431 transitions. [2019-10-13 23:26:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:26:43,063 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:43,063 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-13 23:26:43,064 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:43,066 INFO L82 PathProgramCache]: Analyzing trace with hash 321226243, now seen corresponding path program 1 times [2019-10-13 23:26:43,066 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:43,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555794466] [2019-10-13 23:26:43,066 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:43,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555794466] [2019-10-13 23:26:43,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:43,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:26:43,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175409261] [2019-10-13 23:26:43,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:43,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:43,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:43,213 INFO L87 Difference]: Start difference. First operand 352 states and 431 transitions. Second operand 4 states. [2019-10-13 23:26:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:43,522 INFO L93 Difference]: Finished difference Result 867 states and 1105 transitions. [2019-10-13 23:26:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:43,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-13 23:26:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:43,527 INFO L225 Difference]: With dead ends: 867 [2019-10-13 23:26:43,528 INFO L226 Difference]: Without dead ends: 531 [2019-10-13 23:26:43,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-13 23:26:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 506. [2019-10-13 23:26:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-13 23:26:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 620 transitions. [2019-10-13 23:26:43,576 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 620 transitions. Word has length 60 [2019-10-13 23:26:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:43,577 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 620 transitions. [2019-10-13 23:26:43,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 620 transitions. [2019-10-13 23:26:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:26:43,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:43,579 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-13 23:26:43,579 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -650448444, now seen corresponding path program 1 times [2019-10-13 23:26:43,580 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:43,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402969890] [2019-10-13 23:26:43,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:43,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402969890] [2019-10-13 23:26:43,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:43,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:26:43,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244914201] [2019-10-13 23:26:43,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:26:43,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:26:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:26:43,700 INFO L87 Difference]: Start difference. First operand 506 states and 620 transitions. Second operand 6 states. [2019-10-13 23:26:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:43,839 INFO L93 Difference]: Finished difference Result 1015 states and 1266 transitions. [2019-10-13 23:26:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:26:43,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-13 23:26:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:43,846 INFO L225 Difference]: With dead ends: 1015 [2019-10-13 23:26:43,847 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 23:26:43,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:26:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 23:26:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 585. [2019-10-13 23:26:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 23:26:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 719 transitions. [2019-10-13 23:26:43,910 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 719 transitions. Word has length 60 [2019-10-13 23:26:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:43,911 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 719 transitions. [2019-10-13 23:26:43,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:26:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 719 transitions. [2019-10-13 23:26:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 23:26:43,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:43,918 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-13 23:26:43,918 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:43,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1879581246, now seen corresponding path program 1 times [2019-10-13 23:26:43,919 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:43,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5485200] [2019-10-13 23:26:43,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:43,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:44,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5485200] [2019-10-13 23:26:44,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:44,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:26:44,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209049553] [2019-10-13 23:26:44,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:26:44,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:26:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:26:44,064 INFO L87 Difference]: Start difference. First operand 585 states and 719 transitions. Second operand 6 states. [2019-10-13 23:26:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:44,910 INFO L93 Difference]: Finished difference Result 1086 states and 1467 transitions. [2019-10-13 23:26:44,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:26:44,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-10-13 23:26:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:44,918 INFO L225 Difference]: With dead ends: 1086 [2019-10-13 23:26:44,918 INFO L226 Difference]: Without dead ends: 835 [2019-10-13 23:26:44,920 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-13 23:26:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-10-13 23:26:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 781. [2019-10-13 23:26:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-13 23:26:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1032 transitions. [2019-10-13 23:26:44,984 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1032 transitions. Word has length 73 [2019-10-13 23:26:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:44,985 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1032 transitions. [2019-10-13 23:26:44,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:26:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1032 transitions. [2019-10-13 23:26:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 23:26:44,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:44,987 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-13 23:26:44,987 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1269060783, now seen corresponding path program 1 times [2019-10-13 23:26:44,988 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:44,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052067049] [2019-10-13 23:26:44,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:44,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:44,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:26:45,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052067049] [2019-10-13 23:26:45,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:45,200 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:26:45,200 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434202574] [2019-10-13 23:26:45,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:26:45,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:45,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:26:45,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:26:45,202 INFO L87 Difference]: Start difference. First operand 781 states and 1032 transitions. Second operand 9 states. [2019-10-13 23:26:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:46,595 INFO L93 Difference]: Finished difference Result 1790 states and 2639 transitions. [2019-10-13 23:26:46,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:26:46,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-10-13 23:26:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:46,608 INFO L225 Difference]: With dead ends: 1790 [2019-10-13 23:26:46,609 INFO L226 Difference]: Without dead ends: 1382 [2019-10-13 23:26:46,612 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-13 23:26:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-10-13 23:26:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1255. [2019-10-13 23:26:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-10-13 23:26:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1765 transitions. [2019-10-13 23:26:46,708 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1765 transitions. Word has length 77 [2019-10-13 23:26:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:46,709 INFO L462 AbstractCegarLoop]: Abstraction has 1255 states and 1765 transitions. [2019-10-13 23:26:46,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:26:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1765 transitions. [2019-10-13 23:26:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:26:46,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:46,710 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-13 23:26:46,711 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1025383731, now seen corresponding path program 1 times [2019-10-13 23:26:46,711 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:46,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114428353] [2019-10-13 23:26:46,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:46,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:46,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:46,782 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-13 23:26:46,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114428353] [2019-10-13 23:26:46,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425883208] [2019-10-13 23:26:46,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:46,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:26:46,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:46,968 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-13 23:26:46,968 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:47,049 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-13 23:26:47,050 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:26:47,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-13 23:26:47,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404247309] [2019-10-13 23:26:47,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:47,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:47,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:26:47,052 INFO L87 Difference]: Start difference. First operand 1255 states and 1765 transitions. Second operand 4 states. [2019-10-13 23:26:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:47,190 INFO L93 Difference]: Finished difference Result 3044 states and 4222 transitions. [2019-10-13 23:26:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:47,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 23:26:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:47,205 INFO L225 Difference]: With dead ends: 3044 [2019-10-13 23:26:47,205 INFO L226 Difference]: Without dead ends: 1806 [2019-10-13 23:26:47,218 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-13 23:26:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-10-13 23:26:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1465. [2019-10-13 23:26:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-10-13 23:26:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1930 transitions. [2019-10-13 23:26:47,329 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1930 transitions. Word has length 76 [2019-10-13 23:26:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:47,330 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1930 transitions. [2019-10-13 23:26:47,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1930 transitions. [2019-10-13 23:26:47,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:26:47,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:47,332 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-13 23:26:47,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:47,536 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:47,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash 550466613, now seen corresponding path program 1 times [2019-10-13 23:26:47,537 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:47,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30942586] [2019-10-13 23:26:47,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:47,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:47,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:47,672 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-13 23:26:47,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30942586] [2019-10-13 23:26:47,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705315517] [2019-10-13 23:26:47,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:47,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:26:47,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:47,796 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-13 23:26:47,796 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:47,916 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-13 23:26:47,917 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:26:47,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2019-10-13 23:26:47,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104962748] [2019-10-13 23:26:47,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:47,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:26:47,919 INFO L87 Difference]: Start difference. First operand 1465 states and 1930 transitions. Second operand 4 states. [2019-10-13 23:26:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:48,063 INFO L93 Difference]: Finished difference Result 3383 states and 4415 transitions. [2019-10-13 23:26:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:48,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-13 23:26:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:48,079 INFO L225 Difference]: With dead ends: 3383 [2019-10-13 23:26:48,079 INFO L226 Difference]: Without dead ends: 1935 [2019-10-13 23:26:48,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:26:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-10-13 23:26:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1674. [2019-10-13 23:26:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-13 23:26:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2093 transitions. [2019-10-13 23:26:48,227 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2093 transitions. Word has length 80 [2019-10-13 23:26:48,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:48,228 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2093 transitions. [2019-10-13 23:26:48,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2093 transitions. [2019-10-13 23:26:48,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 23:26:48,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:48,235 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-13 23:26:48,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:48,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:48,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1858550324, now seen corresponding path program 1 times [2019-10-13 23:26:48,442 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:48,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251039048] [2019-10-13 23:26:48,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:48,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:48,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:48,506 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-13 23:26:48,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251039048] [2019-10-13 23:26:48,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:48,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:26:48,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078041242] [2019-10-13 23:26:48,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:48,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:48,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:48,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:48,510 INFO L87 Difference]: Start difference. First operand 1674 states and 2093 transitions. Second operand 4 states. [2019-10-13 23:26:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:48,687 INFO L93 Difference]: Finished difference Result 2918 states and 3658 transitions. [2019-10-13 23:26:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:26:48,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-13 23:26:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:48,698 INFO L225 Difference]: With dead ends: 2918 [2019-10-13 23:26:48,698 INFO L226 Difference]: Without dead ends: 1674 [2019-10-13 23:26:48,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2019-10-13 23:26:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1674. [2019-10-13 23:26:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2019-10-13 23:26:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2089 transitions. [2019-10-13 23:26:48,831 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2089 transitions. Word has length 129 [2019-10-13 23:26:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:48,832 INFO L462 AbstractCegarLoop]: Abstraction has 1674 states and 2089 transitions. [2019-10-13 23:26:48,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2089 transitions. [2019-10-13 23:26:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 23:26:48,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:48,836 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-13 23:26:48,836 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:48,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1602685328, now seen corresponding path program 1 times [2019-10-13 23:26:48,837 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:48,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708775637] [2019-10-13 23:26:48,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:48,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:48,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:49,005 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-13 23:26:49,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708775637] [2019-10-13 23:26:49,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731707630] [2019-10-13 23:26:49,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:49,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 23:26:49,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:49,369 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-13 23:26:49,369 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:49,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:49,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:49,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:49,777 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-13 23:26:49,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:26:49,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-10-13 23:26:49,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893262849] [2019-10-13 23:26:49,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:26:49,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:26:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-13 23:26:49,779 INFO L87 Difference]: Start difference. First operand 1674 states and 2089 transitions. Second operand 11 states. [2019-10-13 23:26:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:51,211 INFO L93 Difference]: Finished difference Result 4988 states and 6359 transitions. [2019-10-13 23:26:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 23:26:51,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2019-10-13 23:26:51,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:51,250 INFO L225 Difference]: With dead ends: 4988 [2019-10-13 23:26:51,250 INFO L226 Difference]: Without dead ends: 3331 [2019-10-13 23:26:51,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 23:26:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-10-13 23:26:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3281. [2019-10-13 23:26:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3281 states. [2019-10-13 23:26:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 4012 transitions. [2019-10-13 23:26:51,521 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 4012 transitions. Word has length 131 [2019-10-13 23:26:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:51,522 INFO L462 AbstractCegarLoop]: Abstraction has 3281 states and 4012 transitions. [2019-10-13 23:26:51,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:26:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 4012 transitions. [2019-10-13 23:26:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 23:26:51,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:51,529 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-13 23:26:51,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:51,735 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:51,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:51,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1977951621, now seen corresponding path program 1 times [2019-10-13 23:26:51,736 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:51,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727814886] [2019-10-13 23:26:51,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:51,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:51,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:51,839 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-13 23:26:51,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727814886] [2019-10-13 23:26:51,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:26:51,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:26:51,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113557418] [2019-10-13 23:26:51,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:26:51,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:26:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:26:51,843 INFO L87 Difference]: Start difference. First operand 3281 states and 4012 transitions. Second operand 4 states. [2019-10-13 23:26:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:52,186 INFO L93 Difference]: Finished difference Result 6251 states and 7657 transitions. [2019-10-13 23:26:52,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:26:52,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-13 23:26:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:52,208 INFO L225 Difference]: With dead ends: 6251 [2019-10-13 23:26:52,209 INFO L226 Difference]: Without dead ends: 3671 [2019-10-13 23:26:52,218 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-13 23:26:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-10-13 23:26:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3572. [2019-10-13 23:26:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-10-13 23:26:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4217 transitions. [2019-10-13 23:26:52,483 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4217 transitions. Word has length 134 [2019-10-13 23:26:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:52,484 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 4217 transitions. [2019-10-13 23:26:52,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:26:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4217 transitions. [2019-10-13 23:26:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 23:26:52,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:52,487 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-13 23:26:52,488 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1810490110, now seen corresponding path program 1 times [2019-10-13 23:26:52,488 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:52,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249680249] [2019-10-13 23:26:52,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:52,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:52,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:52,616 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-13 23:26:52,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249680249] [2019-10-13 23:26:52,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141573138] [2019-10-13 23:26:52,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:52,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:26:52,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:52,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:52,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-13 23:26:52,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:26:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:53,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:53,353 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-13 23:26:53,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:26:53,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 16 [2019-10-13 23:26:53,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999664518] [2019-10-13 23:26:53,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:26:53,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:26:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:26:53,355 INFO L87 Difference]: Start difference. First operand 3572 states and 4217 transitions. Second operand 6 states. [2019-10-13 23:26:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:53,623 INFO L93 Difference]: Finished difference Result 6488 states and 7811 transitions. [2019-10-13 23:26:53,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:26:53,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-10-13 23:26:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:53,642 INFO L225 Difference]: With dead ends: 6488 [2019-10-13 23:26:53,642 INFO L226 Difference]: Without dead ends: 2933 [2019-10-13 23:26:53,653 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-13 23:26:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-10-13 23:26:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2645. [2019-10-13 23:26:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-10-13 23:26:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3102 transitions. [2019-10-13 23:26:53,953 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3102 transitions. Word has length 133 [2019-10-13 23:26:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:53,954 INFO L462 AbstractCegarLoop]: Abstraction has 2645 states and 3102 transitions. [2019-10-13 23:26:53,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:26:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3102 transitions. [2019-10-13 23:26:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 23:26:53,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:53,957 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-13 23:26:54,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:54,171 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1820360425, now seen corresponding path program 1 times [2019-10-13 23:26:54,171 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:54,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690623280] [2019-10-13 23:26:54,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:54,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:54,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:54,299 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-13 23:26:54,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690623280] [2019-10-13 23:26:54,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286568552] [2019-10-13 23:26:54,300 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-13 23:26:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:54,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:26:54,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:54,591 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-13 23:26:54,592 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:54,776 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-13 23:26:54,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:26:54,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 20 [2019-10-13 23:26:54,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568241930] [2019-10-13 23:26:54,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:26:54,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:26:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:26:54,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:26:54,779 INFO L87 Difference]: Start difference. First operand 2645 states and 3102 transitions. Second operand 6 states. [2019-10-13 23:26:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:26:55,536 INFO L93 Difference]: Finished difference Result 5301 states and 6274 transitions. [2019-10-13 23:26:55,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:26:55,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-13 23:26:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:26:55,553 INFO L225 Difference]: With dead ends: 5301 [2019-10-13 23:26:55,553 INFO L226 Difference]: Without dead ends: 2218 [2019-10-13 23:26:55,561 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-13 23:26:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-10-13 23:26:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2143. [2019-10-13 23:26:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2019-10-13 23:26:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 2450 transitions. [2019-10-13 23:26:55,715 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 2450 transitions. Word has length 137 [2019-10-13 23:26:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:26:55,715 INFO L462 AbstractCegarLoop]: Abstraction has 2143 states and 2450 transitions. [2019-10-13 23:26:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:26:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2450 transitions. [2019-10-13 23:26:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 23:26:55,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:26:55,718 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-13 23:26:55,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:55,924 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:26:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:26:55,924 INFO L82 PathProgramCache]: Analyzing trace with hash 112536929, now seen corresponding path program 1 times [2019-10-13 23:26:55,925 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:26:55,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193768053] [2019-10-13 23:26:55,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:55,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:26:55,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:26:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:56,077 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-13 23:26:56,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193768053] [2019-10-13 23:26:56,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870570438] [2019-10-13 23:26:56,078 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-13 23:26:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:26:56,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 23:26:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:26:56,382 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-13 23:26:56,383 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:26:56,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:56,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:56,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:56,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:26:56,639 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-13 23:26:56,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217013498] [2019-10-13 23:26:56,668 INFO L162 IcfgInterpreter]: Started Sifa with 90 locations of interest [2019-10-13 23:26:56,669 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:26:56,675 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:26:56,683 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:26:56,684 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:26:56,955 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 49 for LOIs [2019-10-13 23:26:56,995 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 82 for LOIs [2019-10-13 23:26:57,416 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 47 for LOIs [2019-10-13 23:26:57,458 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 84 for LOIs [2019-10-13 23:26:59,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:26:59,732 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee is_C_1_triggered at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee is_C_1_triggered at de.uni_freiburg.informatik.ultimate.lib.sifa.PriorityWorklist.add(PriorityWorklist.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.lambda$2(DagInterpreter.java:135) at java.lang.Iterable.forEach(Iterable.java:75) at java.util.Collections$UnmodifiableCollection.forEach(Collections.java:1080) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:135) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.computeTopSummary(TopInputCallSummarizer.java:78) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:230) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-13 23:26:59,739 INFO L168 Benchmark]: Toolchain (without parser) took 19438.82 ms. Allocated memory was 146.8 MB in the beginning and 616.6 MB in the end (delta: 469.8 MB). Free memory was 102.9 MB in the beginning and 156.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 416.1 MB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,740 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.44 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.4 MB in the beginning and 181.4 MB in the end (delta: -78.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,742 INFO L168 Benchmark]: Boogie Preprocessor took 50.58 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 179.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,742 INFO L168 Benchmark]: RCFGBuilder took 762.93 ms. Allocated memory is still 205.0 MB. Free memory was 179.5 MB in the beginning and 132.2 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,743 INFO L168 Benchmark]: TraceAbstraction took 18172.02 ms. Allocated memory was 205.0 MB in the beginning and 616.6 MB in the end (delta: 411.6 MB). Free memory was 131.6 MB in the beginning and 156.5 MB in the end (delta: -24.9 MB). Peak memory consumption was 386.6 MB. Max. memory is 7.1 GB. [2019-10-13 23:26:59,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.44 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 102.4 MB in the beginning and 181.4 MB in the end (delta: -78.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.58 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 179.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 762.93 ms. Allocated memory is still 205.0 MB. Free memory was 179.5 MB in the beginning and 132.2 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18172.02 ms. Allocated memory was 205.0 MB in the beginning and 616.6 MB in the end (delta: 411.6 MB). Free memory was 131.6 MB in the beginning and 156.5 MB in the end (delta: -24.9 MB). Peak memory consumption was 386.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee is_C_1_triggered de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: CallReturnSummary for callee is_C_1_triggered: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...