java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/heap-data/packet_filter.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:12:23,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:12:23,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:12:23,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:12:23,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:12:23,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:12:23,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:12:23,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:12:23,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:12:23,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:12:23,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:12:23,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:12:23,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:12:23,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:12:23,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:12:23,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:12:23,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:12:23,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:12:23,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:12:23,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:12:23,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:12:23,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:12:23,304 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:12:23,305 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:12:23,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:12:23,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:12:23,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:12:23,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:12:23,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:12:23,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:12:23,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:12:23,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:12:23,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:12:23,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:12:23,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:12:23,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:12:23,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:12:23,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:12:23,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:12:23,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:12:23,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:12:23,317 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:12:23,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:12:23,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:12:23,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:12:23,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:12:23,334 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:12:23,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:12:23,335 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:12:23,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:12:23,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:12:23,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:12:23,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:12:23,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:12:23,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:12:23,336 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:12:23,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:12:23,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:12:23,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:12:23,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:12:23,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:12:23,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:12:23,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:12:23,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:23,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:12:23,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:12:23,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:12:23,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:12:23,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:12:23,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:12:23,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:12:23,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:12:23,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:12:23,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:12:23,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:12:23,677 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:12:23,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/packet_filter.i [2019-10-13 20:12:23,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a03d9d/91e9474c0012497aace19ea83c38884d/FLAG6609f5f85 [2019-10-13 20:12:24,373 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:12:24,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/packet_filter.i [2019-10-13 20:12:24,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a03d9d/91e9474c0012497aace19ea83c38884d/FLAG6609f5f85 [2019-10-13 20:12:24,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/520a03d9d/91e9474c0012497aace19ea83c38884d [2019-10-13 20:12:24,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:12:24,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:12:24,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:24,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:12:24,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:12:24,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:24" (1/1) ... [2019-10-13 20:12:24,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39aa9343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:24, skipping insertion in model container [2019-10-13 20:12:24,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:12:24" (1/1) ... [2019-10-13 20:12:24,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:12:24,760 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:12:25,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:25,218 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:12:25,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:12:25,335 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:12:25,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25 WrapperNode [2019-10-13 20:12:25,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:12:25,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:12:25,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:12:25,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:12:25,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... [2019-10-13 20:12:25,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:12:25,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:12:25,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:12:25,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:12:25,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:12:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:12:25,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:12:25,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 20:12:25,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 20:12:25,492 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2019-10-13 20:12:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2019-10-13 20:12:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-10-13 20:12:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2019-10-13 20:12:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2019-10-13 20:12:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 20:12:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:12:25,495 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:12:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:12:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:12:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:12:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:12:25,496 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:12:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:12:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:12:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:12:25,500 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:12:25,501 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:12:25,502 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:12:25,503 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:12:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:12:25,505 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:12:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:12:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:12:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:12:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:12:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:12:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:12:25,508 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:12:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:12:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:12:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:12:25,512 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:12:25,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure send [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2019-10-13 20:12:25,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:12:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 20:12:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 20:12:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:12:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:12:26,225 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:12:26,226 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 20:12:26,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:26 BoogieIcfgContainer [2019-10-13 20:12:26,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:12:26,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:12:26,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:12:26,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:12:26,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:12:24" (1/3) ... [2019-10-13 20:12:26,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcdf167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:26, skipping insertion in model container [2019-10-13 20:12:26,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:12:25" (2/3) ... [2019-10-13 20:12:26,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcdf167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:12:26, skipping insertion in model container [2019-10-13 20:12:26,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:12:26" (3/3) ... [2019-10-13 20:12:26,238 INFO L109 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2019-10-13 20:12:26,249 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:12:26,258 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-13 20:12:26,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-13 20:12:26,295 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:12:26,296 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:12:26,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:12:26,296 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:12:26,296 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:12:26,296 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:12:26,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:12:26,297 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:12:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-10-13 20:12:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 20:12:26,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:26,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:26,323 INFO L410 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1068933411, now seen corresponding path program 1 times [2019-10-13 20:12:26,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:26,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037714505] [2019-10-13 20:12:26,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037714505] [2019-10-13 20:12:26,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:26,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:12:26,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944996139] [2019-10-13 20:12:26,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:26,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:26,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:26,522 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2019-10-13 20:12:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:26,552 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2019-10-13 20:12:26,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:26,572 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-13 20:12:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:26,583 INFO L225 Difference]: With dead ends: 100 [2019-10-13 20:12:26,583 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 20:12:26,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:26,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 20:12:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-13 20:12:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 20:12:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-10-13 20:12:26,637 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2019-10-13 20:12:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:26,638 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-10-13 20:12:26,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-10-13 20:12:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 20:12:26,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:26,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:26,640 INFO L410 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:26,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1316192133, now seen corresponding path program 1 times [2019-10-13 20:12:26,641 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:26,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515602159] [2019-10-13 20:12:26,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515602159] [2019-10-13 20:12:26,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:26,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:12:26,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029564993] [2019-10-13 20:12:26,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:12:26,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:12:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:12:26,741 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2019-10-13 20:12:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:26,770 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-13 20:12:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:12:26,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 20:12:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:26,772 INFO L225 Difference]: With dead ends: 60 [2019-10-13 20:12:26,772 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 20:12:26,773 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-13 20:12:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 20:12:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-13 20:12:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 20:12:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-10-13 20:12:26,787 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 15 [2019-10-13 20:12:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:26,788 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-10-13 20:12:26,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:12:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-10-13 20:12:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 20:12:26,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:26,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:26,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190211, now seen corresponding path program 1 times [2019-10-13 20:12:26,790 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:26,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795491256] [2019-10-13 20:12:26,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:26,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:26,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795491256] [2019-10-13 20:12:26,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:26,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:12:26,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276666710] [2019-10-13 20:12:26,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:12:26,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:12:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:12:26,945 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2019-10-13 20:12:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:27,108 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2019-10-13 20:12:27,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:12:27,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-13 20:12:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:27,111 INFO L225 Difference]: With dead ends: 95 [2019-10-13 20:12:27,112 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 20:12:27,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:12:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 20:12:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-13 20:12:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 20:12:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2019-10-13 20:12:27,124 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 15 [2019-10-13 20:12:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:27,125 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2019-10-13 20:12:27,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:12:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2019-10-13 20:12:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 20:12:27,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:27,126 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] [2019-10-13 20:12:27,126 INFO L410 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1729106577, now seen corresponding path program 1 times [2019-10-13 20:12:27,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:27,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805246867] [2019-10-13 20:12:27,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,128 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:27,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805246867] [2019-10-13 20:12:27,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:12:27,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 20:12:27,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145311197] [2019-10-13 20:12:27,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 20:12:27,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:27,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 20:12:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:12:27,282 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2019-10-13 20:12:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:27,685 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2019-10-13 20:12:27,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:12:27,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-13 20:12:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:27,687 INFO L225 Difference]: With dead ends: 100 [2019-10-13 20:12:27,687 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 20:12:27,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:12:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 20:12:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2019-10-13 20:12:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 20:12:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2019-10-13 20:12:27,698 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2019-10-13 20:12:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:27,699 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2019-10-13 20:12:27,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 20:12:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2019-10-13 20:12:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 20:12:27,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:12:27,702 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:12:27,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:12:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:27,703 INFO L82 PathProgramCache]: Analyzing trace with hash 453892566, now seen corresponding path program 1 times [2019-10-13 20:12:27,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:12:27,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686219914] [2019-10-13 20:12:27,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:12:27,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:12:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:28,224 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-10-13 20:12:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:28,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686219914] [2019-10-13 20:12:28,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473660171] [2019-10-13 20:12:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:12:28,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 20:12:28,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:12:28,638 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-13 20:12:28,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-10-13 20:12:28,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-10-13 20:12:28,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:28,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-13 20:12:28,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:28,836 INFO L567 ElimStorePlain]: treesize reduction 28, result has 60.0 percent of original size [2019-10-13 20:12:28,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:28,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:42 [2019-10-13 20:12:29,044 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:29,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:29,088 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:29,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:29,121 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:29,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:29,152 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:29,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:29,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:29,167 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2019-10-13 20:12:33,315 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-10-13 20:12:33,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2019-10-13 20:12:33,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:12:33,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2019-10-13 20:12:33,432 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,470 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:89, output treesize:15 [2019-10-13 20:12:33,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 20:12:33,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 20:12:33,494 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:33,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-13 20:12:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:33,506 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:33,737 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-13 20:12:33,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:33,820 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_67|], 3=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_68|]} [2019-10-13 20:12:33,828 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:33,844 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:33,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:33,929 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:33,935 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:34,021 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,028 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:34,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:34,068 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:34,078 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:34,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:34,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-10-13 20:12:34,098 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:193, output treesize:65 [2019-10-13 20:12:34,660 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-13 20:12:34,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:36,678 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_main_~#prio_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_2| Int)) (or (= (select (select |c_#memory_$Pointer$.base| |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0) (exists ((v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (v_DerPreprocessor_6 Int) (|v_receive_#t~ret5.base_9| Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_1 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_1) v_prenex_2 v_DerPreprocessor_6) (+ v_prenex_2 4) v_DerPreprocessor_9) (+ v_prenex_2 8) |v_receive_#t~ret5.base_9|)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|))) (= 0 (select |c_old(#valid)| v_prenex_1)))) (exists ((v_DerPreprocessor_11 Int) (|v_receive_#t~ret5.offset_9| Int) (v_DerPreprocessor_8 Int) (|v_receive_~#packet~0.base_10| Int) (|v_receive_~#packet~0.offset_10| Int)) (and (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10|) |v_receive_~#packet~0.offset_10| v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_10| 4) v_DerPreprocessor_11) (+ |v_receive_~#packet~0.offset_10| 8) |v_receive_#t~ret5.offset_9|)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_10|) 0))))) (forall ((|v_main_~#prio_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_2| Int)) (or (exists ((v_prenex_2 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (v_DerPreprocessor_6 Int) (|v_receive_#t~ret5.base_9| Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_1 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_1) v_prenex_2 v_DerPreprocessor_6) (+ v_prenex_2 4) v_DerPreprocessor_9) (+ v_prenex_2 8) |v_receive_#t~ret5.base_9|)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|))) (= 0 (select |c_old(#valid)| v_prenex_1)))) (exists ((v_DerPreprocessor_11 Int) (|v_receive_#t~ret5.offset_9| Int) (v_DerPreprocessor_8 Int) (|v_receive_~#packet~0.base_10| Int) (|v_receive_~#packet~0.offset_10| Int)) (and (not (= (select (select (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10|) |v_receive_~#packet~0.offset_10| v_DerPreprocessor_8) (+ |v_receive_~#packet~0.offset_10| 4) v_DerPreprocessor_11) (+ |v_receive_~#packet~0.offset_10| 8) |v_receive_#t~ret5.offset_9|)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0)) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_10|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0)))) is different from false [2019-10-13 20:12:36,691 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-13 20:12:57,168 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 103 [2019-10-13 20:12:57,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:57,182 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-13 20:12:57,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:57,393 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) 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.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.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) 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-13 20:12:57,411 INFO L168 Benchmark]: Toolchain (without parser) took 32710.44 ms. Allocated memory was 143.1 MB in the beginning and 250.6 MB in the end (delta: 107.5 MB). Free memory was 99.7 MB in the beginning and 182.5 MB in the end (delta: -82.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:57,413 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:57,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.91 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 164.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:57,416 INFO L168 Benchmark]: Boogie Preprocessor took 82.25 ms. Allocated memory is still 200.8 MB. Free memory was 164.3 MB in the beginning and 160.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:57,417 INFO L168 Benchmark]: RCFGBuilder took 809.13 ms. Allocated memory is still 200.8 MB. Free memory was 160.9 MB in the beginning and 102.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:57,417 INFO L168 Benchmark]: TraceAbstraction took 31169.31 ms. Allocated memory was 200.8 MB in the beginning and 250.6 MB in the end (delta: 49.8 MB). Free memory was 101.8 MB in the beginning and 182.5 MB in the end (delta: -80.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 20:12:57,424 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.1 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 644.91 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 164.3 MB in the end (delta: -64.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.25 ms. Allocated memory is still 200.8 MB. Free memory was 164.3 MB in the beginning and 160.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.13 ms. Allocated memory is still 200.8 MB. Free memory was 160.9 MB in the beginning and 102.5 MB in the end (delta: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31169.31 ms. Allocated memory was 200.8 MB in the beginning and 250.6 MB in the end (delta: 49.8 MB). Free memory was 101.8 MB in the beginning and 182.5 MB in the end (delta: -80.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...