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/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:20:15,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:20:15,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:20:15,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:20:15,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:20:15,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:20:15,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:20:15,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:20:15,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:20:15,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:20:15,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:20:15,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:20:15,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:20:15,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:20:15,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:20:15,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:20:15,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:20:15,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:20:15,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:20:15,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:20:15,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:20:15,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:20:15,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:20:15,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:20:15,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:20:15,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:20:15,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:20:15,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:20:15,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:20:15,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:20:15,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:20:15,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:20:15,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:20:15,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:20:15,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:20:15,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:20:15,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:20:15,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:20:15,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:20:15,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:20:15,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:20:15,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 02:20:15,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:20:15,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:20:15,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:20:15,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:20:15,219 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:20:15,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:20:15,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:20:15,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:20:15,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:20:15,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:20:15,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:20:15,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:20:15,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:20:15,221 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:20:15,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:20:15,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:20:15,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:20:15,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:20:15,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:20:15,222 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:20:15,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:20:15,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:20:15,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:20:15,223 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:20:15,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:20:15,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:20:15,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:20:15,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:20:15,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:20:15,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:20:15,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:20:15,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:20:15,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:20:15,559 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:20:15,560 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-10-15 02:20:15,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3293dafac/6628c809dbe44d068b037e34ef133bbd/FLAGea89249bf [2019-10-15 02:20:16,320 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:20:16,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-10-15 02:20:16,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3293dafac/6628c809dbe44d068b037e34ef133bbd/FLAGea89249bf [2019-10-15 02:20:16,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3293dafac/6628c809dbe44d068b037e34ef133bbd [2019-10-15 02:20:16,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:20:16,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:20:16,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:20:16,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:20:16,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:20:16,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:20:16" (1/1) ... [2019-10-15 02:20:16,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666905fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:16, skipping insertion in model container [2019-10-15 02:20:16,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:20:16" (1/1) ... [2019-10-15 02:20:16,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:20:16,625 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:20:17,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:20:17,869 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:20:18,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:20:18,254 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:20:18,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18 WrapperNode [2019-10-15 02:20:18,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:20:18,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:20:18,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:20:18,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:20:18,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... [2019-10-15 02:20:18,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:20:18,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:20:18,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:20:18,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:20:18,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:20:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:20:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:20:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-15 02:20:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_mac_header [2019-10-15 02:20:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 02:20:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-15 02:20:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-15 02:20:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-15 02:20:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-15 02:20:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 02:20:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-15 02:20:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-15 02:20:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-15 02:20:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2019-10-15 02:20:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_init [2019-10-15 02:20:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_raw_exit [2019-10-15 02:20:18,525 INFO L138 BoogieDeclarations]: Found implementation of procedure rx [2019-10-15 02:20:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure build_header [2019-10-15 02:20:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_tx [2019-10-15 02:20:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_ArcProto_1 [2019-10-15 02:20:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:20:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_consume_skb_5 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_6 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_7 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_8 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_11 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kfree_skb_13 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_14 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netif_rx_15 [2019-10-15 02:20:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_init [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_add [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_contains [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_is_empty [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-15 02:20:18,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2019-10-15 02:20:18,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_netdev_alloc_skb [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_current [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure arcnet_unregister_proto [2019-10-15 02:20:18,531 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 02:20:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2019-10-15 02:20:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2019-10-15 02:20:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2019-10-15 02:20:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 02:20:18,532 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 02:20:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-15 02:20:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-15 02:20:18,533 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-15 02:20:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:20:18,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-15 02:20:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 02:20:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-15 02:20:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-15 02:20:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_6 [2019-10-15 02:20:18,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_7 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_8 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_11 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kfree_skb_13 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_consume_skb_5 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_14 [2019-10-15 02:20:18,535 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_mac_header [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:20:18,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:20:18,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 02:20:18,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 02:20:18,584 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_ArcProto_1 [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netif_rx_15 [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_unregister_proto [2019-10-15 02:20:18,585 INFO L130 BoogieDeclarations]: Found specification of procedure rx [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure build_header [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_tx [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_init [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure arcnet_raw_exit [2019-10-15 02:20:18,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~X~$Pointer$~X~int~TO~VOID [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-15 02:20:18,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_init [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_add [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_contains [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_is_empty [2019-10-15 02:20:18,588 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_netdev_alloc_skb [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_current [2019-10-15 02:20:18,589 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:20:18,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:20:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-15 02:20:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-15 02:20:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-15 02:20:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-15 02:20:19,313 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-15 02:20:20,431 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:20:20,432 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 02:20:20,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:20:20 BoogieIcfgContainer [2019-10-15 02:20:20,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:20:20,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:20:20,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:20:20,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:20:20,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:20:16" (1/3) ... [2019-10-15 02:20:20,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441c7ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:20:20, skipping insertion in model container [2019-10-15 02:20:20,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:20:18" (2/3) ... [2019-10-15 02:20:20,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441c7ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:20:20, skipping insertion in model container [2019-10-15 02:20:20,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:20:20" (3/3) ... [2019-10-15 02:20:20,442 INFO L109 eAbstractionObserver]: Analyzing ICFG 205_9a_array_safes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--arcnet--arc-rawmode.ko-entry_point.cil.out.i [2019-10-15 02:20:20,453 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:20:20,465 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:20:20,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:20:20,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:20:20,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:20:20,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:20:20,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:20:20,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:20:20,516 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:20:20,516 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:20:20,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:20:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states. [2019-10-15 02:20:20,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 02:20:20,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:20,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:20,559 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:20,565 INFO L82 PathProgramCache]: Analyzing trace with hash -689591432, now seen corresponding path program 1 times [2019-10-15 02:20:20,574 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:20,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798383981] [2019-10-15 02:20:20,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:20,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:20,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:20:21,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798383981] [2019-10-15 02:20:21,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:21,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:20:21,077 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141171855] [2019-10-15 02:20:21,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:20:21,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:20:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:20:21,102 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 3 states. [2019-10-15 02:20:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:21,269 INFO L93 Difference]: Finished difference Result 502 states and 648 transitions. [2019-10-15 02:20:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:20:21,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-15 02:20:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:21,287 INFO L225 Difference]: With dead ends: 502 [2019-10-15 02:20:21,287 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 02:20:21,292 INFO L600 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-15 02:20:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 02:20:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-15 02:20:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-15 02:20:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 384 transitions. [2019-10-15 02:20:21,369 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 384 transitions. Word has length 44 [2019-10-15 02:20:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:21,370 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 384 transitions. [2019-10-15 02:20:21,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:20:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 384 transitions. [2019-10-15 02:20:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 02:20:21,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:21,374 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:21,374 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1799100232, now seen corresponding path program 1 times [2019-10-15 02:20:21,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:21,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607199391] [2019-10-15 02:20:21,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:20:21,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607199391] [2019-10-15 02:20:21,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:21,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:20:21,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278262130] [2019-10-15 02:20:21,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:20:21,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:21,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:20:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:20:21,520 INFO L87 Difference]: Start difference. First operand 314 states and 384 transitions. Second operand 3 states. [2019-10-15 02:20:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:21,566 INFO L93 Difference]: Finished difference Result 611 states and 751 transitions. [2019-10-15 02:20:21,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:20:21,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 02:20:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:21,570 INFO L225 Difference]: With dead ends: 611 [2019-10-15 02:20:21,571 INFO L226 Difference]: Without dead ends: 315 [2019-10-15 02:20:21,574 INFO L600 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-15 02:20:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-15 02:20:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-10-15 02:20:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-15 02:20:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2019-10-15 02:20:21,608 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 45 [2019-10-15 02:20:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:21,609 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2019-10-15 02:20:21,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:20:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2019-10-15 02:20:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 02:20:21,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:21,614 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:21,614 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:21,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1042078497, now seen corresponding path program 1 times [2019-10-15 02:20:21,615 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:21,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785810007] [2019-10-15 02:20:21,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,615 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 02:20:21,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785810007] [2019-10-15 02:20:21,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:21,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:20:21,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859201166] [2019-10-15 02:20:21,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:20:21,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:21,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:20:21,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:20:21,719 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand 5 states. [2019-10-15 02:20:21,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:21,772 INFO L93 Difference]: Finished difference Result 611 states and 748 transitions. [2019-10-15 02:20:21,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:20:21,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 02:20:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:21,776 INFO L225 Difference]: With dead ends: 611 [2019-10-15 02:20:21,777 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 02:20:21,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-15 02:20:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 02:20:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-15 02:20:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-15 02:20:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 381 transitions. [2019-10-15 02:20:21,824 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 381 transitions. Word has length 46 [2019-10-15 02:20:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:21,824 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 381 transitions. [2019-10-15 02:20:21,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:20:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 381 transitions. [2019-10-15 02:20:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-15 02:20:21,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:21,835 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-15 02:20:21,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1264666465, now seen corresponding path program 1 times [2019-10-15 02:20:21,836 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:21,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269112295] [2019-10-15 02:20:21,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:21,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 02:20:22,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269112295] [2019-10-15 02:20:22,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:22,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:20:22,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004939982] [2019-10-15 02:20:22,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:20:22,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:20:22,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:20:22,047 INFO L87 Difference]: Start difference. First operand 314 states and 381 transitions. Second operand 6 states. [2019-10-15 02:20:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:22,415 INFO L93 Difference]: Finished difference Result 618 states and 760 transitions. [2019-10-15 02:20:22,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 02:20:22,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-15 02:20:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:22,422 INFO L225 Difference]: With dead ends: 618 [2019-10-15 02:20:22,422 INFO L226 Difference]: Without dead ends: 601 [2019-10-15 02:20:22,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-15 02:20:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-15 02:20:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2019-10-15 02:20:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-10-15 02:20:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 743 transitions. [2019-10-15 02:20:22,458 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 743 transitions. Word has length 74 [2019-10-15 02:20:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:22,459 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 743 transitions. [2019-10-15 02:20:22,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:20:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 743 transitions. [2019-10-15 02:20:22,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 02:20:22,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:22,463 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:22,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash -756196454, now seen corresponding path program 1 times [2019-10-15 02:20:22,464 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:22,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719384715] [2019-10-15 02:20:22,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-15 02:20:22,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719384715] [2019-10-15 02:20:22,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:22,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:20:22,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379150814] [2019-10-15 02:20:22,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:20:22,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:20:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:20:22,575 INFO L87 Difference]: Start difference. First operand 601 states and 743 transitions. Second operand 3 states. [2019-10-15 02:20:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:22,636 INFO L93 Difference]: Finished difference Result 994 states and 1232 transitions. [2019-10-15 02:20:22,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:20:22,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-10-15 02:20:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:22,639 INFO L225 Difference]: With dead ends: 994 [2019-10-15 02:20:22,639 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 02:20:22,641 INFO L600 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-15 02:20:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 02:20:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 380. [2019-10-15 02:20:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-15 02:20:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 474 transitions. [2019-10-15 02:20:22,663 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 474 transitions. Word has length 115 [2019-10-15 02:20:22,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:22,663 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 474 transitions. [2019-10-15 02:20:22,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:20:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 474 transitions. [2019-10-15 02:20:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 02:20:22,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:22,666 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:22,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1792266860, now seen corresponding path program 2 times [2019-10-15 02:20:22,667 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:22,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574566566] [2019-10-15 02:20:22,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 02:20:22,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574566566] [2019-10-15 02:20:22,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:22,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:20:22,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894200927] [2019-10-15 02:20:22,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:20:22,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:20:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:20:22,887 INFO L87 Difference]: Start difference. First operand 380 states and 474 transitions. Second operand 5 states. [2019-10-15 02:20:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:22,931 INFO L93 Difference]: Finished difference Result 735 states and 932 transitions. [2019-10-15 02:20:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:20:22,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-15 02:20:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:22,938 INFO L225 Difference]: With dead ends: 735 [2019-10-15 02:20:22,938 INFO L226 Difference]: Without dead ends: 394 [2019-10-15 02:20:22,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:20:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-15 02:20:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2019-10-15 02:20:22,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-15 02:20:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 488 transitions. [2019-10-15 02:20:22,971 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 488 transitions. Word has length 115 [2019-10-15 02:20:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:22,973 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 488 transitions. [2019-10-15 02:20:22,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:20:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 488 transitions. [2019-10-15 02:20:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 02:20:22,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:22,977 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:22,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash 444222310, now seen corresponding path program 1 times [2019-10-15 02:20:22,987 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:22,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617275189] [2019-10-15 02:20:22,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:22,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-15 02:20:23,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617275189] [2019-10-15 02:20:23,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:20:23,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 02:20:23,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062648796] [2019-10-15 02:20:23,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:20:23,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:20:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:20:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 02:20:23,138 INFO L87 Difference]: Start difference. First operand 390 states and 488 transitions. Second operand 4 states. [2019-10-15 02:20:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:20:23,169 INFO L93 Difference]: Finished difference Result 757 states and 952 transitions. [2019-10-15 02:20:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 02:20:23,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-10-15 02:20:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:20:23,172 INFO L225 Difference]: With dead ends: 757 [2019-10-15 02:20:23,173 INFO L226 Difference]: Without dead ends: 391 [2019-10-15 02:20:23,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:20:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-10-15 02:20:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2019-10-15 02:20:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-15 02:20:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 489 transitions. [2019-10-15 02:20:23,191 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 489 transitions. Word has length 119 [2019-10-15 02:20:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:20:23,192 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 489 transitions. [2019-10-15 02:20:23,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:20:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 489 transitions. [2019-10-15 02:20:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 02:20:23,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:20:23,194 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:20:23,194 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:20:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:20:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 671415591, now seen corresponding path program 1 times [2019-10-15 02:20:23,195 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:20:23,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043883284] [2019-10-15 02:20:23,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:23,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:20:23,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:20:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:20:23,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043883284] [2019-10-15 02:20:23,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992913600] [2019-10-15 02:20:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:20:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:20:23,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 02:20:23,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:20:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 02:20:23,659 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:20:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:20:23,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373306604] [2019-10-15 02:20:23,835 INFO L162 IcfgInterpreter]: Started Sifa with 100 locations of interest [2019-10-15 02:20:23,835 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:20:23,841 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:20:23,848 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:20:23,849 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:20:25,104 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 97 for LOIs [2019-10-15 02:20:25,259 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 255 for LOIs [2019-10-15 02:20:25,918 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 311 [2019-10-15 02:20:27,227 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 272 [2019-10-15 02:20:37,124 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 340 [2019-10-15 02:20:37,357 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 352 [2019-10-15 02:20:37,670 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 342 [2019-10-15 02:20:37,834 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 354 [2019-10-15 02:20:38,193 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 350 [2019-10-15 02:20:38,360 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 364 [2019-10-15 02:20:38,533 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 352 [2019-10-15 02:20:38,703 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 366 [2019-10-15 02:20:39,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:20:39,684 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:275) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:263) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostconditionCall(PredicateTransformer.java:157) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.postCall(SymbolicTools.java:129) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:228) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:214) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:197) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:166) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:104) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.util.HashMap.computeIfAbsent(HashMap.java:1127) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:178) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:169) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:130) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-15 02:20:39,689 INFO L168 Benchmark]: Toolchain (without parser) took 23187.22 ms. Allocated memory was 140.0 MB in the beginning and 1.0 GB in the end (delta: 907.0 MB). Free memory was 96.6 MB in the beginning and 322.5 MB in the end (delta: -225.9 MB). Peak memory consumption was 681.1 MB. Max. memory is 7.1 GB. [2019-10-15 02:20:39,690 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 140.0 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-15 02:20:39,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1751.73 ms. Allocated memory was 140.0 MB in the beginning and 209.7 MB in the end (delta: 69.7 MB). Free memory was 96.2 MB in the beginning and 110.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 7.1 GB. [2019-10-15 02:20:39,691 INFO L168 Benchmark]: Boogie Preprocessor took 184.48 ms. Allocated memory is still 209.7 MB. Free memory was 110.2 MB in the beginning and 105.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2019-10-15 02:20:39,691 INFO L168 Benchmark]: RCFGBuilder took 1993.10 ms. Allocated memory was 209.7 MB in the beginning and 262.1 MB in the end (delta: 52.4 MB). Free memory was 105.0 MB in the beginning and 191.8 MB in the end (delta: -86.8 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2019-10-15 02:20:39,692 INFO L168 Benchmark]: TraceAbstraction took 19253.26 ms. Allocated memory was 262.1 MB in the beginning and 1.0 GB in the end (delta: 784.9 MB). Free memory was 189.8 MB in the beginning and 322.5 MB in the end (delta: -132.7 MB). Peak memory consumption was 652.1 MB. Max. memory is 7.1 GB. [2019-10-15 02:20:39,694 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.28 ms. Allocated memory is still 140.0 MB. Free memory is still 121.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1751.73 ms. Allocated memory was 140.0 MB in the beginning and 209.7 MB in the end (delta: 69.7 MB). Free memory was 96.2 MB in the beginning and 110.2 MB in the end (delta: -14.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.48 ms. Allocated memory is still 209.7 MB. Free memory was 110.2 MB in the beginning and 105.0 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1993.10 ms. Allocated memory was 209.7 MB in the beginning and 262.1 MB in the end (delta: 52.4 MB). Free memory was 105.0 MB in the beginning and 191.8 MB in the end (delta: -86.8 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19253.26 ms. Allocated memory was 262.1 MB in the beginning and 1.0 GB in the end (delta: 784.9 MB). Free memory was 189.8 MB in the beginning and 322.5 MB in the end (delta: -132.7 MB). Peak memory consumption was 652.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...