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/heap-data/process_queue.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 03:53:08,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 03:53:08,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 03:53:08,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 03:53:08,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 03:53:08,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 03:53:08,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 03:53:08,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 03:53:08,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 03:53:08,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 03:53:08,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 03:53:08,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 03:53:08,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 03:53:08,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 03:53:08,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 03:53:08,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 03:53:08,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 03:53:08,402 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 03:53:08,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 03:53:08,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 03:53:08,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 03:53:08,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 03:53:08,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 03:53:08,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 03:53:08,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 03:53:08,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 03:53:08,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 03:53:08,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 03:53:08,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 03:53:08,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 03:53:08,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 03:53:08,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 03:53:08,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 03:53:08,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 03:53:08,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 03:53:08,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 03:53:08,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 03:53:08,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 03:53:08,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 03:53:08,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 03:53:08,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 03:53:08,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 03:53:08,453 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 03:53:08,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 03:53:08,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 03:53:08,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 03:53:08,456 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 03:53:08,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 03:53:08,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 03:53:08,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 03:53:08,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 03:53:08,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 03:53:08,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 03:53:08,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 03:53:08,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 03:53:08,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 03:53:08,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 03:53:08,459 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 03:53:08,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 03:53:08,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 03:53:08,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 03:53:08,460 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 03:53:08,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 03:53:08,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:53:08,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 03:53:08,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 03:53:08,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 03:53:08,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 03:53:08,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 03:53:08,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 03:53:08,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 03:53:08,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 03:53:08,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 03:53:08,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 03:53:08,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 03:53:08,742 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 03:53:08,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue.i [2019-10-07 03:53:08,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14e5fb9e/7c975ca6b8554e9999b7444ec38c9f16/FLAG6a75ea215 [2019-10-07 03:53:09,334 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 03:53:09,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2019-10-07 03:53:09,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14e5fb9e/7c975ca6b8554e9999b7444ec38c9f16/FLAG6a75ea215 [2019-10-07 03:53:09,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14e5fb9e/7c975ca6b8554e9999b7444ec38c9f16 [2019-10-07 03:53:09,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 03:53:09,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 03:53:09,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 03:53:09,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 03:53:09,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 03:53:09,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:53:09" (1/1) ... [2019-10-07 03:53:09,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3272c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:09, skipping insertion in model container [2019-10-07 03:53:09,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:53:09" (1/1) ... [2019-10-07 03:53:09,682 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 03:53:09,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 03:53:10,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:53:10,272 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 03:53:10,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 03:53:10,398 INFO L192 MainTranslator]: Completed translation [2019-10-07 03:53:10,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10 WrapperNode [2019-10-07 03:53:10,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 03:53:10,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 03:53:10,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 03:53:10,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 03:53:10,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... [2019-10-07 03:53:10,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 03:53:10,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 03:53:10,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 03:53:10,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 03:53:10,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 03:53:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 03:53:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 03:53:10,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure run_process [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2019-10-07 03:53:10,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 03:53:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 03:53:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 03:53:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-07 03:53:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-07 03:53:10,536 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-07 03:53:10,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-07 03:53:10,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-07 03:53:10,539 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-07 03:53:10,540 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-07 03:53:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-07 03:53:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 03:53:10,543 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-07 03:53:10,544 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-07 03:53:10,545 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-07 03:53:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-07 03:53:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-07 03:53:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-07 03:53:10,549 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-07 03:53:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 03:53:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 03:53:10,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 03:53:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 03:53:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 03:53:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 03:53:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 03:53:10,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 03:53:11,362 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 03:53:11,362 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 03:53:11,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:53:11 BoogieIcfgContainer [2019-10-07 03:53:11,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 03:53:11,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 03:53:11,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 03:53:11,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 03:53:11,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:53:09" (1/3) ... [2019-10-07 03:53:11,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e057e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:53:11, skipping insertion in model container [2019-10-07 03:53:11,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:53:10" (2/3) ... [2019-10-07 03:53:11,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e057e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:53:11, skipping insertion in model container [2019-10-07 03:53:11,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:53:11" (3/3) ... [2019-10-07 03:53:11,372 INFO L109 eAbstractionObserver]: Analyzing ICFG process_queue.i [2019-10-07 03:53:11,383 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 03:53:11,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 03:53:11,402 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 03:53:11,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 03:53:11,423 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 03:53:11,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 03:53:11,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 03:53:11,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 03:53:11,424 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 03:53:11,424 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 03:53:11,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 03:53:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-07 03:53:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 03:53:11,446 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:11,447 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:11,449 INFO L410 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:11,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1029668330, now seen corresponding path program 1 times [2019-10-07 03:53:11,465 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:11,465 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:11,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:11,466 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:11,783 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:11,784 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:53:11,784 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 03:53:11,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 03:53:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 03:53:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 03:53:11,811 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 6 states. [2019-10-07 03:53:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:12,014 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-10-07 03:53:12,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 03:53:12,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-07 03:53:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:12,030 INFO L225 Difference]: With dead ends: 77 [2019-10-07 03:53:12,031 INFO L226 Difference]: Without dead ends: 42 [2019-10-07 03:53:12,039 INFO L606 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-07 03:53:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-07 03:53:12,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-10-07 03:53:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-07 03:53:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-07 03:53:12,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 15 [2019-10-07 03:53:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:12,104 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-07 03:53:12,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 03:53:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-07 03:53:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 03:53:12,107 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:12,108 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:12,109 INFO L410 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash -172051464, now seen corresponding path program 1 times [2019-10-07 03:53:12,110 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:12,110 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:12,111 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:12,111 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:12,486 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:12,487 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 03:53:12,487 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 03:53:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 03:53:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 03:53:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 03:53:12,496 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 11 states. [2019-10-07 03:53:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:13,572 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2019-10-07 03:53:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 03:53:13,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-10-07 03:53:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:13,576 INFO L225 Difference]: With dead ends: 80 [2019-10-07 03:53:13,576 INFO L226 Difference]: Without dead ends: 78 [2019-10-07 03:53:13,577 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-10-07 03:53:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-07 03:53:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2019-10-07 03:53:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-07 03:53:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2019-10-07 03:53:13,592 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2019-10-07 03:53:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:13,593 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2019-10-07 03:53:13,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 03:53:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2019-10-07 03:53:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 03:53:13,595 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:13,595 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:13,596 INFO L410 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:13,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1685326830, now seen corresponding path program 1 times [2019-10-07 03:53:13,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:13,596 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:13,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:13,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:13,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:13,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:53:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:14,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-07 03:53:14,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:53:14,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:14,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-07 03:53:14,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:14,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:14,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:14,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-07 03:53:14,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:14,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:14,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:14,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-07 03:53:14,276 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:14,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:14,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:14,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-07 03:53:14,299 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:14,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:14,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:14,309 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:26 [2019-10-07 03:53:16,367 WARN L860 $PredicateComparison]: unable to prove that (exists ((append_to_queue_~n.base Int)) (let ((.cse1 (+ |c_append_to_queue_#in~n.offset| 8))) (and (<= |c_append_to_queue_#in~n.base| append_to_queue_~n.base) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse0 |c_append_to_queue_#in~q.base| (store (select .cse0 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| |c_append_to_queue_#in~n.offset|))) |c_#memory_$Pointer$.offset|) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse2 |c_append_to_queue_#in~q.base| (store (select .cse2 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| append_to_queue_~n.base))) |c_#memory_$Pointer$.base|)))) is different from true [2019-10-07 03:53:16,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:16,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-07 03:53:16,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:16,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:16,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-10-07 03:53:16,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:16,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:16,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:42 [2019-10-07 03:53:16,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 03:53:16,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2019-10-07 03:53:16,693 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-07 03:53:16,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 03:53:16,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-07 03:53:16,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:16,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:16,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 03:53:16,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:7 [2019-10-07 03:53:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:16,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:53:17,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:17,377 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-10-07 03:53:17,825 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-10-07 03:53:17,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 03:53:17,840 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|], 6=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_51|]} [2019-10-07 03:53:17,849 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-07 03:53:17,855 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-07 03:53:17,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:17,943 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-07 03:53:17,952 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-07 03:53:18,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:18,035 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-07 03:53:18,049 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:18,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:18,108 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-07 03:53:18,112 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-07 03:53:18,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 03:53:18,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-10-07 03:53:18,143 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:225, output treesize:229 [2019-10-07 03:53:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:18,631 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 03:53:18,656 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-07 03:53:18,656 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 03:53:18,662 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 03:53:18,669 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 03:53:18,670 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 03:53:18,799 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 03:53:19,650 INFO L199 IcfgInterpreter]: Interpreting procedure check_queue with input of size 45 for LOIs [2019-10-07 03:53:19,729 INFO L199 IcfgInterpreter]: Interpreting procedure append_to_queue with input of size 63 for LOIs [2019-10-07 03:53:19,771 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 03:53:19,776 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 03:53:19,776 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 03:53:19,776 INFO L193 IcfgInterpreter]: Reachable states at location L587-2 satisfy 151#true [2019-10-07 03:53:19,777 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 169#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 03:53:19,777 INFO L193 IcfgInterpreter]: Reachable states at location append_to_queueENTRY satisfy 160#(and (<= |append_to_queue_#in~n.offset| 0) (< |#StackHeapBarrier| |append_to_queue_#in~n.base|) (= 0 (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= 0 |#NULL.base|) (<= |append_to_queue_#in~q.offset| 0) (not (= |append_to_queue_#in~q.base| 0)) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) |append_to_queue_#in~n.offset|) 2147483647) (= (select |#length| |append_to_queue_#in~q.base|) 4) (= 0 (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (<= 0 |append_to_queue_#in~n.offset|) (not (= |append_to_queue_#in~n.base| 0)) (<= 0 (+ (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) |append_to_queue_#in~n.offset|) 2147483648)) (<= 0 |append_to_queue_#in~q.offset|) (= (select |#valid| |append_to_queue_#in~n.base|) 1) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (<= |#NULL.base| 0) (= 1 (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) (+ |append_to_queue_#in~n.offset| 4))) (= 0 |append_to_queue_#in~q.offset|) (= (select |#valid| |append_to_queue_#in~q.base|) 1) (<= |#NULL.offset| 0) (< |append_to_queue_#in~q.base| |#StackHeapBarrier|) (= 0 |append_to_queue_#in~n.offset|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= (select |#length| |append_to_queue_#in~n.base|) 12)) [2019-10-07 03:53:19,777 INFO L193 IcfgInterpreter]: Reachable states at location L587-3 satisfy 156#(or (and (= check_queue_~q.offset |check_queue_#in~q.offset|) (exists ((|v_main_~#queue~0.base_BEFORE_CALL_5| Int) (|v_main_#t~malloc16.base_BEFORE_CALL_3| Int)) (and (= 0 |#NULL.base|) (< |v_main_~#queue~0.base_BEFORE_CALL_5| |#StackHeapBarrier|) (= (select |#valid| |v_main_~#queue~0.base_BEFORE_CALL_5|) 1) (<= |#NULL.base| 0) (= (select |#valid| |v_main_#t~malloc16.base_BEFORE_CALL_3|) 1) (<= 0 |#NULL.base|) (not (= |v_main_~#queue~0.base_BEFORE_CALL_5| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| |v_main_~#queue~0.base_BEFORE_CALL_5|) 0) |check_queue_#in~q.offset|) (= |check_queue_#in~q.base| (select (select |#memory_$Pointer$.base| |v_main_~#queue~0.base_BEFORE_CALL_5|) 0)) (= 4 (select |#length| |v_main_~#queue~0.base_BEFORE_CALL_5|)) (< |#StackHeapBarrier| |v_main_#t~malloc16.base_BEFORE_CALL_3|) (= 0 (select |#valid| 0)) (= (select |#length| |v_main_#t~malloc16.base_BEFORE_CALL_3|) 12) (= |#NULL.offset| 0) (not (= |v_main_#t~malloc16.base_BEFORE_CALL_3| 0)))) (= check_queue_~q.base check_queue_~n~0.base) (= check_queue_~q.offset check_queue_~n~0.offset) (= |check_queue_#in~q.base| check_queue_~q.base)) (exists ((v_check_queue_~n~0.base_13 Int) (v_check_queue_~n~0.offset_13 Int)) (and (= (select (select |#memory_$Pointer$.offset| v_check_queue_~n~0.base_13) (+ v_check_queue_~n~0.offset_13 8)) check_queue_~n~0.offset) (= (select (select |#memory_$Pointer$.base| v_check_queue_~n~0.base_13) (+ v_check_queue_~n~0.offset_13 8)) check_queue_~n~0.base)))) [2019-10-07 03:53:19,778 INFO L193 IcfgInterpreter]: Reachable states at location append_to_queueEXIT satisfy 165#(exists ((v_DerPreprocessor_15 Int)) (and (< |#StackHeapBarrier| |append_to_queue_#in~n.base|) (= 0 (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= append_to_queue_~n.offset |append_to_queue_#in~n.offset|) (= 0 |#NULL.base|) (not (= |append_to_queue_#in~q.base| 0)) (<= 0 |#NULL.base|) (= |append_to_queue_#in~n.base| append_to_queue_~n.base) (= append_to_queue_~q.offset |append_to_queue_#in~q.offset|) (= |append_to_queue_#in~q.base| append_to_queue_~q.base) (= (store (store |old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |old(#memory_$Pointer$.offset)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) (select (select |old(#memory_$Pointer$.offset)| append_to_queue_~q.base) append_to_queue_~q.offset))) append_to_queue_~q.base (store (select (store |old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |old(#memory_$Pointer$.offset)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) (select (select |old(#memory_$Pointer$.offset)| append_to_queue_~q.base) append_to_queue_~q.offset))) append_to_queue_~q.base) append_to_queue_~q.offset append_to_queue_~n.offset)) |#memory_$Pointer$.offset|) (<= 0 |#NULL.offset|) (<= (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) |append_to_queue_#in~n.offset|) 2147483647) (= (select |#length| |append_to_queue_#in~q.base|) 4) (= 0 (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (not (= |append_to_queue_#in~n.base| 0)) (<= 0 (+ (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) |append_to_queue_#in~n.offset|) 2147483648)) (= (select |#valid| |append_to_queue_#in~n.base|) 1) (<= |#NULL.base| 0) (= 1 (select (select |old(#memory_int)| |append_to_queue_#in~n.base|) (+ |append_to_queue_#in~n.offset| 4))) (= 0 |append_to_queue_#in~q.offset|) (= (select |#valid| |append_to_queue_#in~q.base|) 1) (<= |#NULL.offset| 0) (< |append_to_queue_#in~q.base| |#StackHeapBarrier|) (= (store (store |old(#memory_int)| append_to_queue_~n.base (store (select |old(#memory_int)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) v_DerPreprocessor_15)) append_to_queue_~q.base (store (select (store |old(#memory_int)| append_to_queue_~n.base (store (select |old(#memory_int)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) v_DerPreprocessor_15)) append_to_queue_~q.base) append_to_queue_~q.offset (select (select |#memory_int| append_to_queue_~q.base) append_to_queue_~q.offset))) |#memory_int|) (= 0 |append_to_queue_#in~n.offset|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= (select |#length| |append_to_queue_#in~n.base|) 12) (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |old(#memory_$Pointer$.base)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) (select (select |old(#memory_$Pointer$.base)| append_to_queue_~q.base) append_to_queue_~q.offset))) append_to_queue_~q.base (store (select (store |old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |old(#memory_$Pointer$.base)| append_to_queue_~n.base) (+ append_to_queue_~n.offset 8) (select (select |old(#memory_$Pointer$.base)| append_to_queue_~q.base) append_to_queue_~q.offset))) append_to_queue_~q.base) append_to_queue_~q.offset append_to_queue_~n.base))))) [2019-10-07 03:53:19,778 INFO L193 IcfgInterpreter]: Reachable states at location L606 satisfy 95#(and (< |#StackHeapBarrier| |main_#t~malloc16.base|) (= 0 |#NULL.base|) (<= main_~new_process~0.offset 0) (= (select |old(#valid)| |main_~#queue~0.base|) 0) (<= 0 |#NULL.base|) (<= |main_#t~malloc16.offset| 0) (< |main_~#queue~0.base| |#StackHeapBarrier|) (<= 0 (+ main_~new_id~0 2147483648)) (<= 2 main_~next_time~0) (<= 0 |#NULL.offset|) (<= main_~next_time~0 2) (<= |main_~#queue~0.offset| 0) (not (= |main_#t~malloc16.base| 0)) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (<= 0 |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) |main_#t~mem22.offset|) (<= main_~new_id~0 2147483647) (<= |#NULL.base| 0) (= (store (store |old(#length)| |main_~#queue~0.base| 4) |main_#t~malloc16.base| 12) |#length|) (not (= 0 |main_~#queue~0.base|)) (= 0 |main_#t~malloc16.offset|) (= |main_#t~malloc16.offset| main_~new_process~0.offset) (= (select (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 2 main_~next_time~0) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) |main_#t~mem22.base|) (= 0 (select (select |old(#memory_$Pointer$.offset)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= main_~new_process~0.base |main_#t~malloc16.base|) (<= 0 main_~new_process~0.offset) (= |#valid| (store (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base| 1)) (= |#NULL.offset| 0) (= 0 |main_~#queue~0.offset|) (<= 0 |main_#t~malloc16.offset|)) [2019-10-07 03:53:19,778 INFO L193 IcfgInterpreter]: Reachable states at location check_queueENTRY satisfy 100#(exists ((|v_main_~#queue~0.base_BEFORE_CALL_5| Int) (|v_main_#t~malloc16.base_BEFORE_CALL_3| Int)) (and (= 0 |#NULL.base|) (< |v_main_~#queue~0.base_BEFORE_CALL_5| |#StackHeapBarrier|) (= (select |#valid| |v_main_~#queue~0.base_BEFORE_CALL_5|) 1) (<= |#NULL.base| 0) (= (select |#valid| |v_main_#t~malloc16.base_BEFORE_CALL_3|) 1) (<= 0 |#NULL.base|) (not (= |v_main_~#queue~0.base_BEFORE_CALL_5| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| |v_main_~#queue~0.base_BEFORE_CALL_5|) 0) |check_queue_#in~q.offset|) (= |check_queue_#in~q.base| (select (select |#memory_$Pointer$.base| |v_main_~#queue~0.base_BEFORE_CALL_5|) 0)) (= 4 (select |#length| |v_main_~#queue~0.base_BEFORE_CALL_5|)) (< |#StackHeapBarrier| |v_main_#t~malloc16.base_BEFORE_CALL_3|) (= 0 (select |#valid| 0)) (= (select |#length| |v_main_#t~malloc16.base_BEFORE_CALL_3|) 12) (= |#NULL.offset| 0) (not (= |v_main_#t~malloc16.base_BEFORE_CALL_3| 0)))) [2019-10-07 03:53:19,779 INFO L193 IcfgInterpreter]: Reachable states at location L588 satisfy 136#true [2019-10-07 03:53:19,779 INFO L193 IcfgInterpreter]: Reachable states at location L594-3 satisfy 38#(and (= 1 main_~next_time~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= (select |old(#valid)| |main_~#queue~0.base|) 0) (<= main_~next_time~0 1) (not (= 0 |main_~#queue~0.base|)) (= |#valid| (store |old(#valid)| |main_~#queue~0.base| 1)) (<= 0 |#NULL.base|) (< |main_~#queue~0.base| |#StackHeapBarrier|) (<= 1 main_~next_time~0) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (store |old(#length)| |main_~#queue~0.base| 4) |#length|) (<= |main_~#queue~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (<= 0 |main_~#queue~0.offset|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= 0 |main_~#queue~0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:53:19,779 INFO L193 IcfgInterpreter]: Reachable states at location check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 146#true [2019-10-07 03:53:19,780 INFO L193 IcfgInterpreter]: Reachable states at location L595-2 satisfy 51#(and (= |#NULL.base| 0) (or (and (<= |main_~#queue~0.offset| 0) (<= |#NULL.base| 0) (<= 0 (+ |main_#t~nondet13| 2147483648)) (<= |main_#t~nondet13| 2147483647) (<= 0 |main_~#queue~0.offset|) (<= main_~next_time~0 1) (<= 0 |#NULL.base|) (<= 1 main_~next_time~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= |main_~#queue~0.offset| 0) (<= |#NULL.base| 0) (<= |main_#t~nondet13| 0) (<= 0 |main_#t~nondet13|) (<= 0 |main_~#queue~0.offset|) (<= main_~next_time~0 1) (<= 0 |#NULL.base|) (<= 1 main_~next_time~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))) (= main_~next_time~0 1) (= |main_~#queue~0.offset| 0) (= |#NULL.offset| 0)) [2019-10-07 03:53:19,780 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:53:19,780 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2019-10-07 03:53:19,780 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 174#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 03:53:19,781 INFO L193 IcfgInterpreter]: Reachable states at location L594-1 satisfy 43#(and (= 0 |#NULL.base|) (= (select |old(#valid)| |main_~#queue~0.base|) 0) (<= main_~next_time~0 1) (<= 0 |#NULL.base|) (< |main_~#queue~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.offset|) (= (store |old(#length)| |main_~#queue~0.base| 4) |#length|) (<= |main_~#queue~0.offset| 0) (<= 0 |main_~#queue~0.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= 1 main_~next_time~0) (<= |main_#t~nondet12| 2147483647) (<= 0 (+ |main_#t~nondet12| 2147483648)) (<= |#NULL.base| 0) (not (= 0 |main_~#queue~0.base|)) (= |#valid| (store |old(#valid)| |main_~#queue~0.base| 1)) (<= 1 main_~next_time~0) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= 0 |main_~#queue~0.offset|)) [2019-10-07 03:53:19,782 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 03:53:19,783 INFO L193 IcfgInterpreter]: Reachable states at location L589 satisfy 141#true [2019-10-07 03:53:19,783 INFO L193 IcfgInterpreter]: Reachable states at location L600 satisfy 56#(exists ((|v_main_#t~nondet17_4| Int) (v_DerPreprocessor_9 Int) (v_DerPreprocessor_10 Int)) (and (<= 0 (+ |v_main_#t~nondet17_4| 2147483648)) (< |#StackHeapBarrier| |main_#t~malloc16.base|) (= 0 |#NULL.base|) (<= |v_main_#t~nondet17_4| 2147483647) (= (select |old(#valid)| |main_~#queue~0.base|) 0) (<= 0 |#NULL.base|) (< |main_~#queue~0.base| |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| main_~new_process~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~new_process~0.base) main_~new_process~0.offset v_DerPreprocessor_9) (+ main_~new_process~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (+ main_~new_process~0.offset 4))))) (<= 0 (+ main_~new_id~0 2147483648)) (<= 0 |#NULL.offset|) (not (= |main_#t~malloc16.base| 0)) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~new_process~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~new_process~0.base) main_~new_process~0.offset v_DerPreprocessor_10) (+ main_~new_process~0.offset 4) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (+ main_~new_process~0.offset 4))))) (<= main_~new_id~0 2147483647) (<= |#NULL.base| 0) (= (store (store |old(#length)| |main_~#queue~0.base| 4) |main_#t~malloc16.base| 12) |#length|) (not (= 0 |main_~#queue~0.base|)) (= 0 |main_#t~malloc16.offset|) (= |main_#t~malloc16.offset| main_~new_process~0.offset) (= (select (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 2 main_~next_time~0) (= 0 (select (select |old(#memory_$Pointer$.offset)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= main_~new_process~0.base |main_#t~malloc16.base|) (= |#memory_int| (store |old(#memory_int)| main_~new_process~0.base (store (store (select |old(#memory_int)| main_~new_process~0.base) main_~new_process~0.offset |v_main_#t~nondet17_4|) (+ main_~new_process~0.offset 4) 1))) (= |#valid| (store (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base| 1)) (= |#NULL.offset| 0) (= 0 |main_~#queue~0.offset|))) [2019-10-07 03:53:19,783 INFO L193 IcfgInterpreter]: Reachable states at location L601-2 satisfy 76#(and (< |#StackHeapBarrier| |main_#t~malloc16.base|) (= 0 |#NULL.base|) (<= main_~new_process~0.offset 0) (= (select |old(#valid)| |main_~#queue~0.base|) 0) (<= 0 |#NULL.base|) (<= |main_#t~malloc16.offset| 0) (< |main_~#queue~0.base| |#StackHeapBarrier|) (<= 0 (+ main_~new_id~0 2147483648)) (<= 2 main_~next_time~0) (<= 0 |#NULL.offset|) (<= main_~next_time~0 2) (<= |main_~#queue~0.offset| 0) (not (= |main_#t~malloc16.base| 0)) (= 0 (select (select |old(#memory_$Pointer$.base)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (<= 0 |main_~#queue~0.offset|) (<= main_~new_id~0 2147483647) (<= |#NULL.base| 0) (= (store (store |old(#length)| |main_~#queue~0.base| 4) |main_#t~malloc16.base| 12) |#length|) (= 0 |main_#t~malloc16.offset|) (not (= 0 |main_~#queue~0.base|)) (= |main_#t~malloc16.offset| main_~new_process~0.offset) (= (select (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base|) 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (= 2 main_~next_time~0) (= 0 (select (select |old(#memory_$Pointer$.offset)| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= main_~new_process~0.base |main_#t~malloc16.base|) (<= 0 main_~new_process~0.offset) (= |#valid| (store (store |old(#valid)| |main_~#queue~0.base| 1) |main_#t~malloc16.base| 1)) (= |#NULL.offset| 0) (= 0 |main_~#queue~0.offset|) (<= 0 |main_#t~malloc16.offset|)) [2019-10-07 03:53:20,360 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-07 03:53:20,599 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-07 03:53:21,077 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-10-07 03:53:21,575 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-07 03:53:21,871 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-07 03:53:22,191 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 03:53:22,191 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 15] total 40 [2019-10-07 03:53:22,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-07 03:53:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-07 03:53:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1353, Unknown=1, NotChecked=74, Total=1560 [2019-10-07 03:53:22,194 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 40 states. [2019-10-07 03:53:23,038 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-10-07 03:53:23,518 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2019-10-07 03:53:28,450 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-10-07 03:53:29,359 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 88 [2019-10-07 03:53:34,372 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-10-07 03:53:41,147 WARN L191 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-10-07 03:53:42,547 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-10-07 03:53:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:50,473 INFO L93 Difference]: Finished difference Result 153 states and 193 transitions. [2019-10-07 03:53:50,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 03:53:50,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 20 [2019-10-07 03:53:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:50,477 INFO L225 Difference]: With dead ends: 153 [2019-10-07 03:53:50,477 INFO L226 Difference]: Without dead ends: 112 [2019-10-07 03:53:50,482 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=460, Invalid=3323, Unknown=3, NotChecked=120, Total=3906 [2019-10-07 03:53:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-07 03:53:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2019-10-07 03:53:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-07 03:53:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2019-10-07 03:53:50,509 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 20 [2019-10-07 03:53:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:50,509 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2019-10-07 03:53:50,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-07 03:53:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2019-10-07 03:53:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 03:53:50,511 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:50,511 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:50,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:50,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1235894599, now seen corresponding path program 1 times [2019-10-07 03:53:50,717 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:50,718 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:50,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:50,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:50,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 03:53:50,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:50,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:53:50,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-07 03:53:50,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:53:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 03:53:51,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:53:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-07 03:53:51,162 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 03:53:51,162 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 8] total 13 [2019-10-07 03:53:51,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 03:53:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 03:53:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-07 03:53:51,163 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand 9 states. [2019-10-07 03:53:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 03:53:51,355 INFO L93 Difference]: Finished difference Result 183 states and 235 transitions. [2019-10-07 03:53:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 03:53:51,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-10-07 03:53:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 03:53:51,359 INFO L225 Difference]: With dead ends: 183 [2019-10-07 03:53:51,359 INFO L226 Difference]: Without dead ends: 108 [2019-10-07 03:53:51,360 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-07 03:53:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-07 03:53:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2019-10-07 03:53:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-07 03:53:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 124 transitions. [2019-10-07 03:53:51,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 124 transitions. Word has length 32 [2019-10-07 03:53:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 03:53:51,383 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 124 transitions. [2019-10-07 03:53:51,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 03:53:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2019-10-07 03:53:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 03:53:51,384 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 03:53:51,384 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 03:53:51,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:51,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 03:53:51,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 03:53:51,589 INFO L82 PathProgramCache]: Analyzing trace with hash 277187053, now seen corresponding path program 2 times [2019-10-07 03:53:51,589 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 03:53:51,589 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:51,589 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:51,590 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 03:53:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 03:53:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 03:53:52,207 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-07 03:53:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 03:53:52,459 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 03:53:52,459 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 03:53:52,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:53:52,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 03:53:52,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 03:53:52,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-07 03:53:52,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 03:53:54,280 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 37 [2019-10-07 03:53:57,185 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-07 03:53:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 03:53:57,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 03:53:58,271 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-10-07 03:53:59,925 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-10-07 03:54:00,658 WARN L191 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2019-10-07 03:54:00,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 03:54:00,863 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) 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:383) 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:336) 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:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) ... 21 more [2019-10-07 03:54:00,873 INFO L168 Benchmark]: Toolchain (without parser) took 51204.52 ms. Allocated memory was 144.7 MB in the beginning and 370.1 MB in the end (delta: 225.4 MB). Free memory was 99.7 MB in the beginning and 312.7 MB in the end (delta: -212.9 MB). Peak memory consumption was 223.8 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,873 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.77 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 167.3 MB in the end (delta: -67.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,879 INFO L168 Benchmark]: Boogie Preprocessor took 68.58 ms. Allocated memory is still 202.4 MB. Free memory was 167.3 MB in the beginning and 164.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,879 INFO L168 Benchmark]: RCFGBuilder took 895.31 ms. Allocated memory is still 202.4 MB. Free memory was 164.0 MB in the beginning and 102.6 MB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,880 INFO L168 Benchmark]: TraceAbstraction took 49504.18 ms. Allocated memory was 202.4 MB in the beginning and 370.1 MB in the end (delta: 167.8 MB). Free memory was 101.9 MB in the beginning and 312.7 MB in the end (delta: -210.8 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. [2019-10-07 03:54:00,886 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.77 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 167.3 MB in the end (delta: -67.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.58 ms. Allocated memory is still 202.4 MB. Free memory was 167.3 MB in the beginning and 164.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 895.31 ms. Allocated memory is still 202.4 MB. Free memory was 164.0 MB in the beginning and 102.6 MB in the end (delta: 61.5 MB). Peak memory consumption was 61.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49504.18 ms. Allocated memory was 202.4 MB in the beginning and 370.1 MB in the end (delta: 167.8 MB). Free memory was 101.9 MB in the beginning and 312.7 MB in the end (delta: -210.8 MB). Peak memory consumption was 168.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:295) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...