java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/systemc/kundu2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 17:13:44,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 17:13:44,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 17:13:44,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 17:13:44,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 17:13:44,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 17:13:44,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 17:13:44,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 17:13:44,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 17:13:44,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 17:13:44,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 17:13:44,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 17:13:44,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 17:13:44,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 17:13:44,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 17:13:44,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 17:13:44,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 17:13:44,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 17:13:44,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 17:13:44,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 17:13:44,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 17:13:44,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 17:13:44,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 17:13:44,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 17:13:44,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 17:13:44,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 17:13:44,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 17:13:44,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 17:13:44,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 17:13:44,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 17:13:44,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 17:13:44,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 17:13:44,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 17:13:44,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 17:13:44,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 17:13:44,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 17:13:44,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 17:13:44,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 17:13:44,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 17:13:44,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 17:13:44,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 17:13:44,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 17:13:44,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 17:13:44,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 17:13:44,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 17:13:44,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 17:13:44,412 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 17:13:44,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 17:13:44,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 17:13:44,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 17:13:44,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 17:13:44,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 17:13:44,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 17:13:44,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 17:13:44,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 17:13:44,414 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 17:13:44,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 17:13:44,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 17:13:44,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 17:13:44,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 17:13:44,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 17:13:44,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 17:13:44,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 17:13:44,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:13:44,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 17:13:44,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 17:13:44,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 17:13:44,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 17:13:44,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 17:13:44,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 17:13:44,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 17:13:44,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 17:13:44,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 17:13:44,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 17:13:44,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 17:13:44,733 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 17:13:44,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-07 17:13:44,806 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa08ee5f/c59722dd1f8c40a38635f22eea36d33a/FLAGaf13ee04c [2019-10-07 17:13:45,258 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 17:13:45,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu2.cil.c [2019-10-07 17:13:45,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa08ee5f/c59722dd1f8c40a38635f22eea36d33a/FLAGaf13ee04c [2019-10-07 17:13:45,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa08ee5f/c59722dd1f8c40a38635f22eea36d33a [2019-10-07 17:13:45,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 17:13:45,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 17:13:45,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 17:13:45,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 17:13:45,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 17:13:45,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:13:45" (1/1) ... [2019-10-07 17:13:45,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7110c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:45, skipping insertion in model container [2019-10-07 17:13:45,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:13:45" (1/1) ... [2019-10-07 17:13:45,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 17:13:45,691 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 17:13:45,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:13:46,005 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 17:13:46,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 17:13:46,154 INFO L192 MainTranslator]: Completed translation [2019-10-07 17:13:46,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46 WrapperNode [2019-10-07 17:13:46,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 17:13:46,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 17:13:46,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 17:13:46,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 17:13:46,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... [2019-10-07 17:13:46,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 17:13:46,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 17:13:46,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 17:13:46,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 17:13:46,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 17:13:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 17:13:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 17:13:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-07 17:13:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure read_data [2019-10-07 17:13:46,253 INFO L138 BoogieDeclarations]: Found implementation of procedure write_data [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P_1 [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_1_triggered [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P_2 [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure is_P_2_triggered [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure C_1 [2019-10-07 17:13:46,254 INFO L138 BoogieDeclarations]: Found implementation of procedure is_C_1_triggered [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-07 17:13:46,255 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-07 17:13:46,256 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-07 17:13:46,257 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-07 17:13:46,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 17:13:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 17:13:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 17:13:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure read_data [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure write_data [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure P_1 [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_1_triggered [2019-10-07 17:13:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure P_2 [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure is_P_2_triggered [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure C_1 [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure is_C_1_triggered [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-07 17:13:46,259 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 17:13:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 17:13:47,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 17:13:47,088 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-07 17:13:47,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:13:47 BoogieIcfgContainer [2019-10-07 17:13:47,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 17:13:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 17:13:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 17:13:47,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 17:13:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:13:45" (1/3) ... [2019-10-07 17:13:47,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275c1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:13:47, skipping insertion in model container [2019-10-07 17:13:47,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:13:46" (2/3) ... [2019-10-07 17:13:47,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275c1a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:13:47, skipping insertion in model container [2019-10-07 17:13:47,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:13:47" (3/3) ... [2019-10-07 17:13:47,098 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu2.cil.c [2019-10-07 17:13:47,108 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 17:13:47,116 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 17:13:47,127 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 17:13:47,154 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 17:13:47,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 17:13:47,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 17:13:47,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 17:13:47,155 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 17:13:47,155 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 17:13:47,155 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 17:13:47,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 17:13:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2019-10-07 17:13:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 17:13:47,185 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:47,186 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:47,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:47,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash -555226142, now seen corresponding path program 1 times [2019-10-07 17:13:47,202 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:47,202 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:47,203 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:47,203 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:47,544 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:47,545 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:47,545 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:47,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:47,568 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 4 states. [2019-10-07 17:13:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:47,950 INFO L93 Difference]: Finished difference Result 403 states and 547 transitions. [2019-10-07 17:13:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:47,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-07 17:13:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:47,970 INFO L225 Difference]: With dead ends: 403 [2019-10-07 17:13:47,971 INFO L226 Difference]: Without dead ends: 260 [2019-10-07 17:13:47,977 INFO L606 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-07 17:13:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-07 17:13:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2019-10-07 17:13:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-07 17:13:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 321 transitions. [2019-10-07 17:13:48,102 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 321 transitions. Word has length 66 [2019-10-07 17:13:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:48,103 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 321 transitions. [2019-10-07 17:13:48,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 321 transitions. [2019-10-07 17:13:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 17:13:48,107 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:48,108 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:48,108 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:48,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1974924545, now seen corresponding path program 1 times [2019-10-07 17:13:48,109 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:48,109 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:48,109 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:48,110 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:48,244 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:48,245 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:48,245 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:13:48,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:13:48,252 INFO L87 Difference]: Start difference. First operand 253 states and 321 transitions. Second operand 4 states. [2019-10-07 17:13:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:48,583 INFO L93 Difference]: Finished difference Result 718 states and 950 transitions. [2019-10-07 17:13:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:48,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-07 17:13:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:48,599 INFO L225 Difference]: With dead ends: 718 [2019-10-07 17:13:48,599 INFO L226 Difference]: Without dead ends: 481 [2019-10-07 17:13:48,606 INFO L606 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-07 17:13:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-10-07 17:13:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 458. [2019-10-07 17:13:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-07 17:13:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 573 transitions. [2019-10-07 17:13:48,711 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 573 transitions. Word has length 66 [2019-10-07 17:13:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:48,712 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 573 transitions. [2019-10-07 17:13:48,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 573 transitions. [2019-10-07 17:13:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 17:13:48,722 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:48,722 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:48,723 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash -53869737, now seen corresponding path program 1 times [2019-10-07 17:13:48,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:48,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:48,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:48,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:48,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:48,966 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:48,966 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 17:13:48,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:13:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:13:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 17:13:48,968 INFO L87 Difference]: Start difference. First operand 458 states and 573 transitions. Second operand 6 states. [2019-10-07 17:13:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:49,102 INFO L93 Difference]: Finished difference Result 1196 states and 1548 transitions. [2019-10-07 17:13:49,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 17:13:49,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-07 17:13:49,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:49,110 INFO L225 Difference]: With dead ends: 1196 [2019-10-07 17:13:49,110 INFO L226 Difference]: Without dead ends: 755 [2019-10-07 17:13:49,112 INFO L606 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-07 17:13:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-07 17:13:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 731. [2019-10-07 17:13:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-07 17:13:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 927 transitions. [2019-10-07 17:13:49,169 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 927 transitions. Word has length 67 [2019-10-07 17:13:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:49,170 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 927 transitions. [2019-10-07 17:13:49,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:13:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 927 transitions. [2019-10-07 17:13:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 17:13:49,172 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:49,172 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:49,172 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 712803888, now seen corresponding path program 1 times [2019-10-07 17:13:49,173 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:49,173 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:49,173 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:49,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:49,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:49,443 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:49,443 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 17:13:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 17:13:49,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 17:13:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-07 17:13:49,446 INFO L87 Difference]: Start difference. First operand 731 states and 927 transitions. Second operand 8 states. [2019-10-07 17:13:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:50,840 INFO L93 Difference]: Finished difference Result 2380 states and 3439 transitions. [2019-10-07 17:13:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 17:13:50,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-10-07 17:13:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:50,854 INFO L225 Difference]: With dead ends: 2380 [2019-10-07 17:13:50,854 INFO L226 Difference]: Without dead ends: 1762 [2019-10-07 17:13:50,859 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-07 17:13:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-10-07 17:13:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1649. [2019-10-07 17:13:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-10-07 17:13:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2319 transitions. [2019-10-07 17:13:50,983 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2319 transitions. Word has length 80 [2019-10-07 17:13:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:50,983 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2319 transitions. [2019-10-07 17:13:50,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 17:13:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2319 transitions. [2019-10-07 17:13:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-07 17:13:50,985 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:50,986 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:50,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:50,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash -852047705, now seen corresponding path program 1 times [2019-10-07 17:13:50,986 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:50,987 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:50,987 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,987 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:51,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:51,148 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:51,149 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 17:13:51,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 17:13:51,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 17:13:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:51,150 INFO L87 Difference]: Start difference. First operand 1649 states and 2319 transitions. Second operand 9 states. [2019-10-07 17:13:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:52,784 INFO L93 Difference]: Finished difference Result 1945 states and 2959 transitions. [2019-10-07 17:13:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 17:13:52,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-10-07 17:13:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:52,799 INFO L225 Difference]: With dead ends: 1945 [2019-10-07 17:13:52,799 INFO L226 Difference]: Without dead ends: 1942 [2019-10-07 17:13:52,800 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-10-07 17:13:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-10-07 17:13:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1753. [2019-10-07 17:13:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-10-07 17:13:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2548 transitions. [2019-10-07 17:13:52,912 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2548 transitions. Word has length 85 [2019-10-07 17:13:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:52,912 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 2548 transitions. [2019-10-07 17:13:52,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 17:13:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2548 transitions. [2019-10-07 17:13:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-07 17:13:52,914 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:52,915 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:52,915 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2099101405, now seen corresponding path program 1 times [2019-10-07 17:13:52,916 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:52,916 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:52,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:52,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:52,990 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:52,990 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:53,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:13:53,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:13:53,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:53,260 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:13:53,260 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-10-07 17:13:53,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:53,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:53,262 INFO L87 Difference]: Start difference. First operand 1753 states and 2548 transitions. Second operand 4 states. [2019-10-07 17:13:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:53,530 INFO L93 Difference]: Finished difference Result 4472 states and 6595 transitions. [2019-10-07 17:13:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:53,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-07 17:13:53,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:53,557 INFO L225 Difference]: With dead ends: 4472 [2019-10-07 17:13:53,557 INFO L226 Difference]: Without dead ends: 2736 [2019-10-07 17:13:53,575 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-07 17:13:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-10-07 17:13:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2249. [2019-10-07 17:13:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-10-07 17:13:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3231 transitions. [2019-10-07 17:13:53,796 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3231 transitions. Word has length 85 [2019-10-07 17:13:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:53,797 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 3231 transitions. [2019-10-07 17:13:53,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3231 transitions. [2019-10-07 17:13:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 17:13:53,801 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:53,801 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:54,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:54,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1219328812, now seen corresponding path program 1 times [2019-10-07 17:13:54,007 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:54,007 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:54,007 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:54,007 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 17:13:54,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:54,132 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:54,132 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 17:13:54,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 17:13:54,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 17:13:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:13:54,133 INFO L87 Difference]: Start difference. First operand 2249 states and 3231 transitions. Second operand 7 states. [2019-10-07 17:13:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:54,738 INFO L93 Difference]: Finished difference Result 5841 states and 8726 transitions. [2019-10-07 17:13:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 17:13:54,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-07 17:13:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:54,770 INFO L225 Difference]: With dead ends: 5841 [2019-10-07 17:13:54,771 INFO L226 Difference]: Without dead ends: 3695 [2019-10-07 17:13:54,794 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-10-07 17:13:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2019-10-07 17:13:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3614. [2019-10-07 17:13:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2019-10-07 17:13:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5213 transitions. [2019-10-07 17:13:55,066 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5213 transitions. Word has length 96 [2019-10-07 17:13:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:55,068 INFO L462 AbstractCegarLoop]: Abstraction has 3614 states and 5213 transitions. [2019-10-07 17:13:55,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 17:13:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5213 transitions. [2019-10-07 17:13:55,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 17:13:55,072 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:55,073 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:55,073 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:55,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1715576570, now seen corresponding path program 1 times [2019-10-07 17:13:55,074 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:55,074 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:55,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:55,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 17:13:55,218 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:55,219 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:55,219 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 17:13:55,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 17:13:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 17:13:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 17:13:55,220 INFO L87 Difference]: Start difference. First operand 3614 states and 5213 transitions. Second operand 8 states. [2019-10-07 17:13:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:55,977 INFO L93 Difference]: Finished difference Result 8140 states and 12009 transitions. [2019-10-07 17:13:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 17:13:55,978 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-10-07 17:13:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:56,011 INFO L225 Difference]: With dead ends: 8140 [2019-10-07 17:13:56,011 INFO L226 Difference]: Without dead ends: 3993 [2019-10-07 17:13:56,037 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-07 17:13:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3993 states. [2019-10-07 17:13:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3993 to 3877. [2019-10-07 17:13:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2019-10-07 17:13:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 5668 transitions. [2019-10-07 17:13:56,307 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 5668 transitions. Word has length 100 [2019-10-07 17:13:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:56,308 INFO L462 AbstractCegarLoop]: Abstraction has 3877 states and 5668 transitions. [2019-10-07 17:13:56,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 17:13:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 5668 transitions. [2019-10-07 17:13:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 17:13:56,315 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:56,315 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:56,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:56,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:56,316 INFO L82 PathProgramCache]: Analyzing trace with hash -518224059, now seen corresponding path program 1 times [2019-10-07 17:13:56,317 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:56,317 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:56,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:56,318 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 17:13:56,497 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:56,497 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:56,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:13:56,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 17:13:56,675 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 17:13:56,806 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:13:56,806 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 3] total 11 [2019-10-07 17:13:56,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:13:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:13:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 17:13:56,808 INFO L87 Difference]: Start difference. First operand 3877 states and 5668 transitions. Second operand 3 states. [2019-10-07 17:13:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:57,148 INFO L93 Difference]: Finished difference Result 9626 states and 14451 transitions. [2019-10-07 17:13:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:13:57,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-07 17:13:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:57,202 INFO L225 Difference]: With dead ends: 9626 [2019-10-07 17:13:57,203 INFO L226 Difference]: Without dead ends: 5766 [2019-10-07 17:13:57,247 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-07 17:13:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-10-07 17:13:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5210. [2019-10-07 17:13:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5210 states. [2019-10-07 17:13:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7507 transitions. [2019-10-07 17:13:57,634 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7507 transitions. Word has length 102 [2019-10-07 17:13:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:57,634 INFO L462 AbstractCegarLoop]: Abstraction has 5210 states and 7507 transitions. [2019-10-07 17:13:57,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:13:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7507 transitions. [2019-10-07 17:13:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 17:13:57,642 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:57,642 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:57,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:57,848 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash 468891600, now seen corresponding path program 1 times [2019-10-07 17:13:57,848 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:57,849 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:57,849 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:57,849 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:13:57,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:57,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:13:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:58,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 17:13:58,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:13:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 17:13:58,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:13:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:13:58,237 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 17:13:58,237 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-07 17:13:58,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:13:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:13:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:13:58,239 INFO L87 Difference]: Start difference. First operand 5210 states and 7507 transitions. Second operand 4 states. [2019-10-07 17:13:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:58,602 INFO L93 Difference]: Finished difference Result 13475 states and 19117 transitions. [2019-10-07 17:13:58,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:13:58,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-07 17:13:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:58,656 INFO L225 Difference]: With dead ends: 13475 [2019-10-07 17:13:58,657 INFO L226 Difference]: Without dead ends: 8282 [2019-10-07 17:13:58,689 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 17:13:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2019-10-07 17:13:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 7341. [2019-10-07 17:13:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7341 states. [2019-10-07 17:13:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10069 transitions. [2019-10-07 17:13:59,168 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10069 transitions. Word has length 104 [2019-10-07 17:13:59,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:13:59,170 INFO L462 AbstractCegarLoop]: Abstraction has 7341 states and 10069 transitions. [2019-10-07 17:13:59,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:13:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10069 transitions. [2019-10-07 17:13:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 17:13:59,174 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:13:59,174 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:13:59,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:13:59,384 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:13:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:13:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1692868379, now seen corresponding path program 1 times [2019-10-07 17:13:59,384 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:13:59,385 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:59,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:59,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:13:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:13:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:13:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:13:59,437 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:13:59,438 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:13:59,438 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 17:13:59,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 17:13:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 17:13:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:13:59,439 INFO L87 Difference]: Start difference. First operand 7341 states and 10069 transitions. Second operand 3 states. [2019-10-07 17:13:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:13:59,800 INFO L93 Difference]: Finished difference Result 17526 states and 24227 transitions. [2019-10-07 17:13:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 17:13:59,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-07 17:13:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:13:59,850 INFO L225 Difference]: With dead ends: 17526 [2019-10-07 17:13:59,850 INFO L226 Difference]: Without dead ends: 10202 [2019-10-07 17:13:59,876 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 17:13:59,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10202 states. [2019-10-07 17:14:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10202 to 8362. [2019-10-07 17:14:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-10-07 17:14:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 11397 transitions. [2019-10-07 17:14:00,443 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 11397 transitions. Word has length 105 [2019-10-07 17:14:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:00,443 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 11397 transitions. [2019-10-07 17:14:00,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 17:14:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 11397 transitions. [2019-10-07 17:14:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 17:14:00,447 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:00,447 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:00,447 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash 40776413, now seen corresponding path program 1 times [2019-10-07 17:14:00,448 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:00,448 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:00,448 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:00,449 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 17:14:00,609 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:00,609 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:00,609 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 17:14:00,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 17:14:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 17:14:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-07 17:14:00,611 INFO L87 Difference]: Start difference. First operand 8362 states and 11397 transitions. Second operand 12 states. [2019-10-07 17:14:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:02,759 INFO L93 Difference]: Finished difference Result 17361 states and 24030 transitions. [2019-10-07 17:14:02,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 17:14:02,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2019-10-07 17:14:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:02,807 INFO L225 Difference]: With dead ends: 17361 [2019-10-07 17:14:02,808 INFO L226 Difference]: Without dead ends: 9228 [2019-10-07 17:14:02,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-10-07 17:14:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2019-10-07 17:14:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8645. [2019-10-07 17:14:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-10-07 17:14:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 11903 transitions. [2019-10-07 17:14:03,311 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 11903 transitions. Word has length 106 [2019-10-07 17:14:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:03,312 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 11903 transitions. [2019-10-07 17:14:03,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 17:14:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 11903 transitions. [2019-10-07 17:14:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 17:14:03,317 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:03,317 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 17:14:03,318 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -389092132, now seen corresponding path program 1 times [2019-10-07 17:14:03,318 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:03,318 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:03,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:03,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-07 17:14:03,383 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:03,383 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:03,383 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:14:03,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:03,388 INFO L87 Difference]: Start difference. First operand 8645 states and 11903 transitions. Second operand 4 states. [2019-10-07 17:14:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:04,003 INFO L93 Difference]: Finished difference Result 17454 states and 24668 transitions. [2019-10-07 17:14:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:04,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-10-07 17:14:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:04,036 INFO L225 Difference]: With dead ends: 17454 [2019-10-07 17:14:04,036 INFO L226 Difference]: Without dead ends: 6518 [2019-10-07 17:14:04,069 INFO L606 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-07 17:14:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6518 states. [2019-10-07 17:14:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6518 to 6308. [2019-10-07 17:14:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6308 states. [2019-10-07 17:14:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6308 states to 6308 states and 8161 transitions. [2019-10-07 17:14:04,390 INFO L78 Accepts]: Start accepts. Automaton has 6308 states and 8161 transitions. Word has length 149 [2019-10-07 17:14:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:04,390 INFO L462 AbstractCegarLoop]: Abstraction has 6308 states and 8161 transitions. [2019-10-07 17:14:04,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6308 states and 8161 transitions. [2019-10-07 17:14:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 17:14:04,397 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:04,397 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:04,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:04,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:04,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1337317932, now seen corresponding path program 1 times [2019-10-07 17:14:04,400 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:04,400 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:04,400 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:04,400 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 17:14:04,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:04,453 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:04,454 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:14:04,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:04,455 INFO L87 Difference]: Start difference. First operand 6308 states and 8161 transitions. Second operand 4 states. [2019-10-07 17:14:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:04,978 INFO L93 Difference]: Finished difference Result 15508 states and 20833 transitions. [2019-10-07 17:14:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:04,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-07 17:14:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:05,020 INFO L225 Difference]: With dead ends: 15508 [2019-10-07 17:14:05,020 INFO L226 Difference]: Without dead ends: 9216 [2019-10-07 17:14:05,042 INFO L606 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-07 17:14:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2019-10-07 17:14:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8786. [2019-10-07 17:14:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8786 states. [2019-10-07 17:14:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8786 states to 8786 states and 11423 transitions. [2019-10-07 17:14:05,526 INFO L78 Accepts]: Start accepts. Automaton has 8786 states and 11423 transitions. Word has length 132 [2019-10-07 17:14:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:05,527 INFO L462 AbstractCegarLoop]: Abstraction has 8786 states and 11423 transitions. [2019-10-07 17:14:05,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 8786 states and 11423 transitions. [2019-10-07 17:14:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 17:14:05,539 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:05,540 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:05,540 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash -463840237, now seen corresponding path program 1 times [2019-10-07 17:14:05,541 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:05,541 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:05,542 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:05,542 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-07 17:14:05,638 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:05,638 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:05,638 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 17:14:05,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 17:14:05,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 17:14:05,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 17:14:05,640 INFO L87 Difference]: Start difference. First operand 8786 states and 11423 transitions. Second operand 4 states. [2019-10-07 17:14:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:06,148 INFO L93 Difference]: Finished difference Result 16060 states and 21147 transitions. [2019-10-07 17:14:06,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 17:14:06,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-07 17:14:06,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:06,189 INFO L225 Difference]: With dead ends: 16060 [2019-10-07 17:14:06,190 INFO L226 Difference]: Without dead ends: 9862 [2019-10-07 17:14:06,210 INFO L606 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-07 17:14:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9862 states. [2019-10-07 17:14:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9862 to 9862. [2019-10-07 17:14:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9862 states. [2019-10-07 17:14:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9862 states to 9862 states and 12524 transitions. [2019-10-07 17:14:06,663 INFO L78 Accepts]: Start accepts. Automaton has 9862 states and 12524 transitions. Word has length 132 [2019-10-07 17:14:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:06,664 INFO L462 AbstractCegarLoop]: Abstraction has 9862 states and 12524 transitions. [2019-10-07 17:14:06,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 17:14:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9862 states and 12524 transitions. [2019-10-07 17:14:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-07 17:14:06,669 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:06,669 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:06,669 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:06,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1318512795, now seen corresponding path program 1 times [2019-10-07 17:14:06,670 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:06,670 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:06,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:06,670 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 17:14:06,824 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:06,825 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:06,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-07 17:14:06,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 17:14:07,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-07 17:14:07,212 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:07,212 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 5] total 18 [2019-10-07 17:14:07,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 17:14:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 17:14:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-07 17:14:07,214 INFO L87 Difference]: Start difference. First operand 9862 states and 12524 transitions. Second operand 5 states. [2019-10-07 17:14:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:08,460 INFO L93 Difference]: Finished difference Result 21033 states and 27289 transitions. [2019-10-07 17:14:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 17:14:08,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-07 17:14:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:08,513 INFO L225 Difference]: With dead ends: 21033 [2019-10-07 17:14:08,513 INFO L226 Difference]: Without dead ends: 14540 [2019-10-07 17:14:08,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-10-07 17:14:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14540 states. [2019-10-07 17:14:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14540 to 13920. [2019-10-07 17:14:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13920 states. [2019-10-07 17:14:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13920 states to 13920 states and 17703 transitions. [2019-10-07 17:14:09,172 INFO L78 Accepts]: Start accepts. Automaton has 13920 states and 17703 transitions. Word has length 133 [2019-10-07 17:14:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:09,173 INFO L462 AbstractCegarLoop]: Abstraction has 13920 states and 17703 transitions. [2019-10-07 17:14:09,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 17:14:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 13920 states and 17703 transitions. [2019-10-07 17:14:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-07 17:14:09,178 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:09,178 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:09,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:09,383 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2032127136, now seen corresponding path program 1 times [2019-10-07 17:14:09,384 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:09,384 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:09,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:09,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:09,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-07 17:14:09,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:09,587 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 17:14:09,588 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 17:14:09,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 17:14:09,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 17:14:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 17:14:09,589 INFO L87 Difference]: Start difference. First operand 13920 states and 17703 transitions. Second operand 5 states. [2019-10-07 17:14:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:10,453 INFO L93 Difference]: Finished difference Result 27004 states and 35626 transitions. [2019-10-07 17:14:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 17:14:10,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-07 17:14:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:10,519 INFO L225 Difference]: With dead ends: 27004 [2019-10-07 17:14:10,519 INFO L226 Difference]: Without dead ends: 14926 [2019-10-07 17:14:10,544 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 17:14:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14926 states. [2019-10-07 17:14:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14926 to 14192. [2019-10-07 17:14:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14192 states. [2019-10-07 17:14:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14192 states to 14192 states and 17960 transitions. [2019-10-07 17:14:11,371 INFO L78 Accepts]: Start accepts. Automaton has 14192 states and 17960 transitions. Word has length 145 [2019-10-07 17:14:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:11,372 INFO L462 AbstractCegarLoop]: Abstraction has 14192 states and 17960 transitions. [2019-10-07 17:14:11,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 17:14:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14192 states and 17960 transitions. [2019-10-07 17:14:11,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-07 17:14:11,378 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:11,378 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:11,378 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1762326492, now seen corresponding path program 1 times [2019-10-07 17:14:11,379 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:11,379 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:11,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:11,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 17:14:11,506 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:11,506 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:11,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 17:14:11,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:14:11,933 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:12,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:12,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:12,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:12,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-07 17:14:12,337 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:12,337 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 8] total 24 [2019-10-07 17:14:12,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 17:14:12,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 17:14:12,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-07 17:14:12,339 INFO L87 Difference]: Start difference. First operand 14192 states and 17960 transitions. Second operand 11 states. [2019-10-07 17:14:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:15,359 INFO L93 Difference]: Finished difference Result 38661 states and 52151 transitions. [2019-10-07 17:14:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-07 17:14:15,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 147 [2019-10-07 17:14:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:15,441 INFO L225 Difference]: With dead ends: 38661 [2019-10-07 17:14:15,441 INFO L226 Difference]: Without dead ends: 24486 [2019-10-07 17:14:15,488 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 17:14:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24486 states. [2019-10-07 17:14:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24486 to 23654. [2019-10-07 17:14:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23654 states. [2019-10-07 17:14:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23654 states to 23654 states and 29928 transitions. [2019-10-07 17:14:16,754 INFO L78 Accepts]: Start accepts. Automaton has 23654 states and 29928 transitions. Word has length 147 [2019-10-07 17:14:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:16,754 INFO L462 AbstractCegarLoop]: Abstraction has 23654 states and 29928 transitions. [2019-10-07 17:14:16,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 17:14:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23654 states and 29928 transitions. [2019-10-07 17:14:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-07 17:14:16,759 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:16,760 INFO L385 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-07 17:14:16,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:16,964 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash -454422290, now seen corresponding path program 1 times [2019-10-07 17:14:16,965 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:16,965 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:16,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:16,965 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-07 17:14:17,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:17,103 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:17,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 17:14:17,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:17,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 17:14:17,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:17,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 17:14:17,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-07 17:14:17,900 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 17:14:17,900 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 6] total 16 [2019-10-07 17:14:17,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 17:14:17,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 17:14:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-07 17:14:17,903 INFO L87 Difference]: Start difference. First operand 23654 states and 29928 transitions. Second operand 6 states. [2019-10-07 17:14:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 17:14:19,128 INFO L93 Difference]: Finished difference Result 42980 states and 55106 transitions. [2019-10-07 17:14:19,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 17:14:19,129 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-07 17:14:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 17:14:19,214 INFO L225 Difference]: With dead ends: 42980 [2019-10-07 17:14:19,214 INFO L226 Difference]: Without dead ends: 19343 [2019-10-07 17:14:19,269 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 294 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-07 17:14:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19343 states. [2019-10-07 17:14:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19343 to 17401. [2019-10-07 17:14:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17401 states. [2019-10-07 17:14:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17401 states to 17401 states and 21525 transitions. [2019-10-07 17:14:20,096 INFO L78 Accepts]: Start accepts. Automaton has 17401 states and 21525 transitions. Word has length 149 [2019-10-07 17:14:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 17:14:20,096 INFO L462 AbstractCegarLoop]: Abstraction has 17401 states and 21525 transitions. [2019-10-07 17:14:20,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 17:14:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 17401 states and 21525 transitions. [2019-10-07 17:14:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-07 17:14:20,102 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 17:14:20,103 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 17:14:20,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:20,307 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 17:14:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 17:14:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1446346277, now seen corresponding path program 1 times [2019-10-07 17:14:20,308 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 17:14:20,308 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:20,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:20,308 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 17:14:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 17:14:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 17:14:20,466 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 17:14:20,466 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 17:14:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 17:14:20,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 17:14:20,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 17:14:21,652 WARN L191 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-10-07 17:14:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 17:14:21,706 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 17:14:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:21,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:21,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:21,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 17:14:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-07 17:14:21,992 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 17:14:22,022 INFO L162 IcfgInterpreter]: Started Sifa with 98 locations of interest [2019-10-07 17:14:22,023 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 17:14:22,029 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 17:14:22,037 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 17:14:22,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 17:14:22,316 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 61 for LOIs [2019-10-07 17:14:22,363 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 102 for LOIs [2019-10-07 17:14:22,887 INFO L199 IcfgInterpreter]: Interpreting procedure init_model with input of size 55 for LOIs [2019-10-07 17:14:22,939 INFO L199 IcfgInterpreter]: Interpreting procedure start_simulation with input of size 106 for LOIs [2019-10-07 17:14:25,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 17:14:25,343 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:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: Tried to insert element unknown in custom order: 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:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 17:14:25,350 INFO L168 Benchmark]: Toolchain (without parser) took 39721.96 ms. Allocated memory was 137.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 102.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 433.4 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,351 INFO L168 Benchmark]: CDTParser took 1.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,357 INFO L168 Benchmark]: CACSL2BoogieTranslator took 526.90 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 178.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,357 INFO L168 Benchmark]: Boogie Preprocessor took 46.20 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 175.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,358 INFO L168 Benchmark]: RCFGBuilder took 888.13 ms. Allocated memory is still 201.9 MB. Free memory was 175.3 MB in the beginning and 116.6 MB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,359 INFO L168 Benchmark]: TraceAbstraction took 38256.01 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 116.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 383.9 MB. Max. memory is 7.1 GB. [2019-10-07 17:14:25,371 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 526.90 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 178.0 MB in the end (delta: -76.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.20 ms. Allocated memory is still 201.9 MB. Free memory was 178.0 MB in the beginning and 175.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 888.13 ms. Allocated memory is still 201.9 MB. Free memory was 175.3 MB in the beginning and 116.6 MB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38256.01 ms. Allocated memory was 201.9 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 116.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 383.9 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:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...