java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:24:19,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:24:19,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:24:19,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:24:19,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:24:19,380 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:24:19,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:24:19,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:24:19,386 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:24:19,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:24:19,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:24:19,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:24:19,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:24:19,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:24:19,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:24:19,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:24:19,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:24:19,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:24:19,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:24:19,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:24:19,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:24:19,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:24:19,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:24:19,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:24:19,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:24:19,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:24:19,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:24:19,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:24:19,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:24:19,429 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:24:19,429 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:24:19,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:24:19,430 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:24:19,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:24:19,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:24:19,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:24:19,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:24:19,459 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:24:19,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:24:19,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:24:19,461 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:24:19,462 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:24:19,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:24:19,462 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:24:19,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:24:19,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:24:19,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:24:19,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:24:19,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:24:19,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:24:19,465 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:24:19,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:24:19,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:24:19,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:24:19,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:24:19,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:24:19,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:24:19,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:24:19,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:24:19,469 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:24:19,469 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:24:19,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:24:19,469 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:24:19,469 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:24:19,470 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:24:19,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:24:19,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:24:19,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:24:19,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:24:19,543 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:24:19,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i [2018-11-14 18:24:19,605 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cad07167/b08fc9a0cc1c49bea2336f341e1cec53/FLAG07ea722d2 [2018-11-14 18:24:20,160 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:24:20,162 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i [2018-11-14 18:24:20,177 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cad07167/b08fc9a0cc1c49bea2336f341e1cec53/FLAG07ea722d2 [2018-11-14 18:24:20,194 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cad07167/b08fc9a0cc1c49bea2336f341e1cec53 [2018-11-14 18:24:20,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:24:20,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:24:20,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:24:20,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:24:20,210 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:24:20,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:24:20" (1/1) ... [2018-11-14 18:24:20,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cc45f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:20, skipping insertion in model container [2018-11-14 18:24:20,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:24:20" (1/1) ... [2018-11-14 18:24:20,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:24:20,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:24:20,761 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:24:20,782 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:24:20,855 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:24:21,008 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:24:21,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21 WrapperNode [2018-11-14 18:24:21,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:24:21,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:24:21,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:24:21,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:24:21,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (1/1) ... [2018-11-14 18:24:21,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:24:21,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:24:21,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:24:21,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:24:21,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (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 [2018-11-14 18:24:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:24:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:24:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:24:21,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:24:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-14 18:24:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2018-11-14 18:24:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2018-11-14 18:24:21,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:24:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:24:21,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:24:21,215 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:24:21,216 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:24:21,217 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:24:21,218 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:24:21,219 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:24:21,220 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:24:21,221 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:24:21,222 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:24:21,223 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:24:21,224 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:24:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:24:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:24:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:24:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:24:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:24:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:24:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:24:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:24:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:24:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:24:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:24:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:24:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:24:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-14 18:24:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:24:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:24:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:24:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:24:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:24:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:24:22,436 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:24:22,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:24:22 BoogieIcfgContainer [2018-11-14 18:24:22,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:24:22,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:24:22,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:24:22,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:24:22,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:24:20" (1/3) ... [2018-11-14 18:24:22,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469bda90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:24:22, skipping insertion in model container [2018-11-14 18:24:22,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:24:21" (2/3) ... [2018-11-14 18:24:22,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469bda90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:24:22, skipping insertion in model container [2018-11-14 18:24:22,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:24:22" (3/3) ... [2018-11-14 18:24:22,445 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2018-11-14 18:24:22,455 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:24:22,465 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:24:22,487 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:24:22,539 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:24:22,540 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:24:22,540 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:24:22,540 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:24:22,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:24:22,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:24:22,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:24:22,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:24:22,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:24:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 18:24:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:24:22,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:24:22,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:24:22,575 INFO L423 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:24:22,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:24:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 438461495, now seen corresponding path program 1 times [2018-11-14 18:24:22,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:24:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:24:22,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:24:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:22,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:24:22,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:24:22,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:24:22,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:22,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:22,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:24:22,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:24:23,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-11-14 18:24:23,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:24:23,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:24:23,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:24:23,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:24:23,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:23,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-14 18:24:23,750 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:24,032 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 18:24:24,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 18:24:24,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 18:24:24,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #103#return; {45#true} is VALID [2018-11-14 18:24:24,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret22 := main(); {45#true} is VALID [2018-11-14 18:24:24,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:24,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} assume true; {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:24,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:24,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} assume !(~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32);havoc #t~nondet13; {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:24,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} assume !~bvsgt32(~next_time~0, 1bv32); {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:24,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {65#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {81#(and (= |main_#t~mem21.base| (_ bv0 32)) (= |main_#t~mem21.offset| (_ bv0 32)))} is VALID [2018-11-14 18:24:24,047 INFO L256 TraceCheckUtils]: 11: Hoare triple {81#(and (= |main_#t~mem21.base| (_ bv0 32)) (= |main_#t~mem21.offset| (_ bv0 32)))} call check_queue(#t~mem21.base, #t~mem21.offset); {85#(and (= |check_queue_#in~q.base| (_ bv0 32)) (= (_ bv0 32) |check_queue_#in~q.offset|))} is VALID [2018-11-14 18:24:24,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {85#(and (= |check_queue_#in~q.base| (_ bv0 32)) (= (_ bv0 32) |check_queue_#in~q.offset|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {89#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:24,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {89#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume true; {89#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:24,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {89#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {46#false} is VALID [2018-11-14 18:24:24,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {46#false} is VALID [2018-11-14 18:24:24,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 18:24:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:24:24,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:24:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:24:24,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:24:24,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 18:24:24,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:24:24,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:24:24,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:24:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:24:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:24:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:24:24,139 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 6 states. [2018-11-14 18:24:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:25,402 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2018-11-14 18:24:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:24:25,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 18:24:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:24:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:24:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 18:24:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:24:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-14 18:24:25,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2018-11-14 18:24:25,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:24:25,661 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:24:25,661 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:24:25,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:24:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:24:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-14 18:24:25,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:24:25,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-14 18:24:25,753 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-14 18:24:25,753 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-14 18:24:25,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:25,761 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-14 18:24:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-14 18:24:25,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:24:25,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:24:25,763 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-14 18:24:25,763 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-14 18:24:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:25,770 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-14 18:24:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2018-11-14 18:24:25,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:24:25,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:24:25,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:24:25,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:24:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 18:24:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-11-14 18:24:25,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2018-11-14 18:24:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:24:25,779 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-11-14 18:24:25,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:24:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 18:24:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:24:25,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:24:25,780 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:24:25,781 INFO L423 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:24:25,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:24:25,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1616169676, now seen corresponding path program 1 times [2018-11-14 18:24:25,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:24:25,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:24:25,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:24:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:25,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:24:25,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:24:25,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 18:24:26,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:24:26,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 18:24:26,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:26,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:26,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:26,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:26,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-14 18:24:26,082 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:26,322 INFO L303 Elim1Store]: Index analysis took 150 ms [2018-11-14 18:24:26,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 18:24:26,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 18:24:26,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:27,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:24:27,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:27,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-11-14 18:24:27,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-14 18:24:27,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:27,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:28,323 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-14 18:24:28,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 18:24:28,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:24:28,426 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:28,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 18:24:28,702 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-14 18:24:28,813 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:24:28,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:29,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 18:24:29,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 18:24:29,084 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:29,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:24:29,353 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:29,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 18:24:29,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 25 treesize of output 28 [2018-11-14 18:24:29,713 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:29,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 18:24:29,892 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-14 18:24:29,932 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:24:30,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-14 18:24:30,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-14 18:24:30,167 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:30,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-14 18:24:30,361 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-14 18:24:30,397 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:30,420 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:30,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:24:30,437 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 3 variables, input treesize:88, output treesize:24 [2018-11-14 18:24:32,575 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:32,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:24:32,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:24:32,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:32,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:32,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 18:24:32,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-14 18:24:32,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:32,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:32,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:32,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2018-11-14 18:24:32,978 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:33,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:24:33,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:24:33,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:33,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:33,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 18:24:33,127 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:33,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID [2018-11-14 18:24:33,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {394#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {394#true} is VALID [2018-11-14 18:24:33,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {394#true} assume true; {394#true} is VALID [2018-11-14 18:24:33,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {394#true} {394#true} #103#return; {394#true} is VALID [2018-11-14 18:24:33,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {394#true} call #t~ret22 := main(); {394#true} is VALID [2018-11-14 18:24:33,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {394#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:24:33,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume true; {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:24:33,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:24:33,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {424#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:24:33,165 INFO L256 TraceCheckUtils]: 9: Hoare triple {424#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {428#(exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:24:33,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#(exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {432#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} is VALID [2018-11-14 18:24:33,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {432#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} assume true; {432#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} is VALID [2018-11-14 18:24:33,172 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {432#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_1 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_1) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} {424#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} #97#return; {439#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:24:33,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {443#(and (= (_ bv1 32) (select (select |#memory_int| |main_#t~mem21.base|) (_ bv4 32))) (= |main_#t~mem21.offset| (_ bv0 32)))} is VALID [2018-11-14 18:24:33,176 INFO L256 TraceCheckUtils]: 14: Hoare triple {443#(and (= (_ bv1 32) (select (select |#memory_int| |main_#t~mem21.base|) (_ bv4 32))) (= |main_#t~mem21.offset| (_ bv0 32)))} call check_queue(#t~mem21.base, #t~mem21.offset); {447#(and (= (bvadd (select (select |#memory_int| |check_queue_#in~q.base|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |check_queue_#in~q.offset|))} is VALID [2018-11-14 18:24:33,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {447#(and (= (bvadd (select (select |#memory_int| |check_queue_#in~q.base|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) |check_queue_#in~q.offset|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {451#(and (= (_ bv1 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:33,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {451#(and (= (_ bv1 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} assume true; {451#(and (= (_ bv1 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:33,184 INFO L273 TraceCheckUtils]: 17: Hoare triple {451#(and (= (_ bv1 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {458#(= (bvadd |check_queue_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:24:33,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {458#(= (bvadd |check_queue_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {395#false} is VALID [2018-11-14 18:24:33,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {395#false} assume !false; {395#false} is VALID [2018-11-14 18:24:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:24:33,188 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:24:33,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:24:33,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-14 18:24:33,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-14 18:24:33,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:24:33,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:24:33,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:24:33,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:24:33,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:24:33,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:24:33,257 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 11 states. [2018-11-14 18:24:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:36,328 INFO L93 Difference]: Finished difference Result 134 states and 162 transitions. [2018-11-14 18:24:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:24:36,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-14 18:24:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:24:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:24:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-14 18:24:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:24:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-14 18:24:36,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 158 transitions. [2018-11-14 18:24:36,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:24:36,703 INFO L225 Difference]: With dead ends: 134 [2018-11-14 18:24:36,703 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:24:36,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:24:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:24:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2018-11-14 18:24:36,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:24:36,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 70 states. [2018-11-14 18:24:36,821 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 70 states. [2018-11-14 18:24:36,821 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 70 states. [2018-11-14 18:24:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:36,830 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2018-11-14 18:24:36,830 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-11-14 18:24:36,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:24:36,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:24:36,832 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 103 states. [2018-11-14 18:24:36,832 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 103 states. [2018-11-14 18:24:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:24:36,839 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2018-11-14 18:24:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2018-11-14 18:24:36,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:24:36,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:24:36,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:24:36,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:24:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:24:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-11-14 18:24:36,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 20 [2018-11-14 18:24:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:24:36,846 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-14 18:24:36,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:24:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-14 18:24:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:24:36,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:24:36,847 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:24:36,848 INFO L423 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:24:36,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:24:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1194803731, now seen corresponding path program 1 times [2018-11-14 18:24:36,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:24:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:24:36,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:24:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:24:36,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:24:37,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-14 18:24:37,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:24:37,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:24:37,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:24:37,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:24:37,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,386 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,399 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2018-11-14 18:24:37,447 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:37,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:24:37,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:24:37,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 18:24:37,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:37,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-11-14 18:24:38,012 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-14 18:24:38,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-14 18:24:38,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 18:24:38,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-14 18:24:38,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-14 18:24:38,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-14 18:24:38,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 18:24:38,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:24:38,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-11-14 18:24:38,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-14 18:24:38,538 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:38,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:24:38,582 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:92, output treesize:44 [2018-11-14 18:24:40,637 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:41,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:24:41,201 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:24:41,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-14 18:24:41,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:24:41,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-14 18:24:41,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-11-14 18:24:41,243 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:24:41,282 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:24:41,287 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:24:41,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-14 18:24:41,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 18:24:41,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:24:41,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-11-14 18:24:41,385 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:24:41,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {947#true} call ULTIMATE.init(); {947#true} is VALID [2018-11-14 18:24:41,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {947#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {947#true} is VALID [2018-11-14 18:24:41,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {947#true} assume true; {947#true} is VALID [2018-11-14 18:24:41,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} #103#return; {947#true} is VALID [2018-11-14 18:24:41,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {947#true} call #t~ret22 := main(); {947#true} is VALID [2018-11-14 18:24:41,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {947#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} is VALID [2018-11-14 18:24:41,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} assume true; {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} is VALID [2018-11-14 18:24:41,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} is VALID [2018-11-14 18:24:41,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {967#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_~#queue~0.base|)))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {977#(and (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} is VALID [2018-11-14 18:24:41,457 INFO L256 TraceCheckUtils]: 9: Hoare triple {977#(and (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {981#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:24:41,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {981#(and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {985#(and (= (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |#memory_$Pointer$.offset|) (= (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:24:41,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {985#(and (= (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |#memory_$Pointer$.offset|) (= (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |#memory_$Pointer$.base|))} assume true; {985#(and (= (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |#memory_$Pointer$.offset|) (= (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:24:41,524 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {985#(and (= (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |#memory_$Pointer$.offset|) (= (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |#memory_$Pointer$.base|))} {977#(and (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|) (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32)))} #97#return; {992#(and (= (_ bv0 32) |main_~#queue~0.offset|) (exists ((main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-14 18:24:41,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {992#(and (= (_ bv0 32) |main_~#queue~0.offset|) (exists ((main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32)))))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {996#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32)) (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32)))))} is VALID [2018-11-14 18:24:41,533 INFO L256 TraceCheckUtils]: 14: Hoare triple {996#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32)) (= |main_#t~mem21.offset| (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32))) (= |main_#t~mem21.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32)))))} call check_queue(#t~mem21.base, #t~mem21.offset); {1000#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= |check_queue_#in~q.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) |check_queue_#in~q.offset|) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-14 18:24:41,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {1000#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= |check_queue_#in~q.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) |check_queue_#in~q.offset|) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-14 18:24:41,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} assume true; {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-14 18:24:41,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-14 18:24:41,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} assume !!~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} is VALID [2018-11-14 18:24:41,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {1004#(exists ((|main_~#queue~0.base| (_ BitVec 32)) (main_~new_process~0.base (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32))) (not (= main_~new_process~0.base |main_~#queue~0.base|)) (= main_~new_process~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.base| main_~new_process~0.base) (_ bv8 32)))) (= (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (_ bv0 32)) check_queue_~n~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)))) (= check_queue_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~new_process~0.base) (_ bv8 32)) (_ bv0 32))))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);~n~0.base, ~n~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:41,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume true; {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:24:41,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {948#false} is VALID [2018-11-14 18:24:41,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {948#false} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {948#false} is VALID [2018-11-14 18:24:41,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {948#false} assume !false; {948#false} is VALID [2018-11-14 18:24:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:24:41,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:24:43,850 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:24:44,040 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:24:44,559 WARN L179 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-14 18:24:45,057 WARN L179 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-14 18:24:48,791 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 18:25:00,635 WARN L179 SmtUtils]: Spent 3.45 s on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 18:25:00,716 INFO L273 TraceCheckUtils]: 23: Hoare triple {948#false} assume !false; {948#false} is VALID [2018-11-14 18:25:00,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {948#false} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {948#false} is VALID [2018-11-14 18:25:00,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {948#false} is VALID [2018-11-14 18:25:00,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} assume true; {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:25:00,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);~n~0.base, ~n~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1017#(and (= (_ bv0 32) check_queue_~n~0.base) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:25:00,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} assume !!~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} assume true; {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {1055#(and (= (select (select |#memory_$Pointer$.base| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv8 32))) (_ bv0 32)))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {1042#(and (= (select (select |#memory_$Pointer$.base| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,729 INFO L256 TraceCheckUtils]: 14: Hoare triple {1059#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv8 32))) (_ bv0 32)))} call check_queue(#t~mem21.base, #t~mem21.offset); {1055#(and (= (select (select |#memory_$Pointer$.base| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv8 32)))))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {1059#(and (= (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv8 32))) (_ bv0 32)))} is VALID [2018-11-14 18:25:00,735 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1071#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32))))} {1067#(and (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.offset)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))) (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.base)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))))} #97#return; {1063#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv8 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv8 32)))))} is VALID [2018-11-14 18:25:00,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {1071#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32))))} assume true; {1071#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-14 18:25:01,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (and (= (select (select (store (store |#memory_$Pointer$.offset| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.offset| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |#memory_$Pointer$.offset| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.offset| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select (store (store |#memory_$Pointer$.base| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.base| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |#memory_$Pointer$.base| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.base| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {1071#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv8 32))) (_ bv0 32))))} is VALID [2018-11-14 18:25:01,056 INFO L256 TraceCheckUtils]: 9: Hoare triple {1067#(and (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.offset)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))) (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.base)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {1078#(or (not (= (select (select (store (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.base)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (and (= (select (select (store (store |#memory_$Pointer$.offset| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.offset| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |#memory_$Pointer$.offset| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.offset| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32)) (= (select (select (store (store |#memory_$Pointer$.base| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.base| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |#memory_$Pointer$.base| |append_to_queue_#in~n.base| (store (select |#memory_$Pointer$.base| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.base|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base| (store (select (store |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base| (store (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32)) (select (select |old(#memory_$Pointer$.offset)| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|))) |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset| |append_to_queue_#in~n.offset|)) |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv8 32))))))} is VALID [2018-11-14 18:25:01,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {1067#(and (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| main_~new_process~0.base (store (select |#memory_$Pointer$.offset| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.offset)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))) (= (_ bv0 32) (select (select (store (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| main_~new_process~0.base (store (select |#memory_$Pointer$.base| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| main_~new_process~0.base)) main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv8 32)))))} is VALID [2018-11-14 18:25:01,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-14 18:25:01,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} assume true; {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-14 18:25:01,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {947#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {1082#(and (forall ((v_prenex_8 (_ BitVec 32))) (or (= (select (select (store (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.offset| v_prenex_8 (store (select |#memory_$Pointer$.offset| v_prenex_8) (_ bv8 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| (_ bv0 32))) v_prenex_8) (_ bv8 32)) (_ bv0 32)) (not (= (select |#valid| v_prenex_8) (_ bv0 1))))) (forall ((|v_main_#t~malloc15.base_2| (_ BitVec 32))) (or (not (= (select |#valid| |v_main_#t~malloc15.base_2|) (_ bv0 1))) (= (select (select (store (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base| (store (select (store |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2| (store (select |#memory_$Pointer$.base| |v_main_#t~malloc15.base_2|) (_ bv8 32) (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|))) |main_~#queue~0.base|) |main_~#queue~0.offset| |v_main_#t~malloc15.base_2|)) |v_main_#t~malloc15.base_2|) (_ bv8 32)) (_ bv0 32)))))} is VALID [2018-11-14 18:25:01,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {947#true} call #t~ret22 := main(); {947#true} is VALID [2018-11-14 18:25:01,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} #103#return; {947#true} is VALID [2018-11-14 18:25:01,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {947#true} assume true; {947#true} is VALID [2018-11-14 18:25:01,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {947#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {947#true} is VALID [2018-11-14 18:25:01,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {947#true} call ULTIMATE.init(); {947#true} is VALID [2018-11-14 18:25:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:25:01,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-14 18:25:01,090 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-11-14 18:25:01,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:01,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:25:05,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 37 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:05,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:25:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:25:05,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=290, Unknown=8, NotChecked=0, Total=342 [2018-11-14 18:25:05,238 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 19 states. [2018-11-14 18:25:08,711 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-14 18:25:11,037 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-11-14 18:25:23,533 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2018-11-14 18:25:26,480 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 18:25:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:34,678 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2018-11-14 18:25:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:25:34,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-11-14 18:25:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:25:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2018-11-14 18:25:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:25:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2018-11-14 18:25:34,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 134 transitions. [2018-11-14 18:25:39,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 132 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:39,374 INFO L225 Difference]: With dead ends: 151 [2018-11-14 18:25:39,375 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:25:39,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=112, Invalid=635, Unknown=9, NotChecked=0, Total=756 [2018-11-14 18:25:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:25:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2018-11-14 18:25:39,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:39,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 94 states. [2018-11-14 18:25:39,709 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 94 states. [2018-11-14 18:25:39,709 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 94 states. [2018-11-14 18:25:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:39,716 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 18:25:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 18:25:39,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:39,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:39,721 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 103 states. [2018-11-14 18:25:39,721 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 103 states. [2018-11-14 18:25:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:39,726 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-14 18:25:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-14 18:25:39,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:39,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:39,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:39,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:25:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-11-14 18:25:39,732 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 24 [2018-11-14 18:25:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:39,733 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-11-14 18:25:39,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:25:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-11-14 18:25:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:25:39,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:39,734 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:25:39,734 INFO L423 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:39,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:39,735 INFO L82 PathProgramCache]: Analyzing trace with hash 173006008, now seen corresponding path program 1 times [2018-11-14 18:25:39,735 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:39,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:39,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:40,317 INFO L303 Elim1Store]: Index analysis took 136 ms [2018-11-14 18:25:40,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 18:25:40,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:25:40,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:40,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 18:25:40,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 18:25:41,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 25 treesize of output 28 [2018-11-14 18:25:41,239 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 18:25:41,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:41,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:25:41,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-14 18:25:41,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-14 18:25:41,649 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-14 18:25:41,824 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:41,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,871 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-11-14 18:25:41,905 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:41,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-14 18:25:41,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-14 18:25:41,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:41,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-14 18:25:41,966 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:42,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {1656#true} call ULTIMATE.init(); {1656#true} is VALID [2018-11-14 18:25:42,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {1656#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1656#true} is VALID [2018-11-14 18:25:42,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {1656#true} assume true; {1656#true} is VALID [2018-11-14 18:25:42,018 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1656#true} {1656#true} #103#return; {1656#true} is VALID [2018-11-14 18:25:42,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {1656#true} call #t~ret22 := main(); {1656#true} is VALID [2018-11-14 18:25:42,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {1656#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} is VALID [2018-11-14 18:25:42,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} assume true; {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} is VALID [2018-11-14 18:25:42,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} is VALID [2018-11-14 18:25:42,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {1676#(= (_ bv0 32) |main_~#queue~0.offset|)} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {1686#(and (= (_ bv0 32) |main_~#queue~0.offset|) (not (= main_~new_process~0.base (_ bv0 32))))} is VALID [2018-11-14 18:25:42,022 INFO L256 TraceCheckUtils]: 9: Hoare triple {1686#(and (= (_ bv0 32) |main_~#queue~0.offset|) (not (= main_~new_process~0.base (_ bv0 32))))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {1656#true} is VALID [2018-11-14 18:25:42,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {1656#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {1693#(= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|)} is VALID [2018-11-14 18:25:42,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {1693#(= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|)} assume true; {1693#(= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|)} is VALID [2018-11-14 18:25:42,028 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {1693#(= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|)} {1686#(and (= (_ bv0 32) |main_~#queue~0.offset|) (not (= main_~new_process~0.base (_ bv0 32))))} #97#return; {1700#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32))) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:42,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {1700#(and (not (= (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv0 32))) (= (_ bv0 32) |main_~#queue~0.offset|))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {1704#(not (= |main_#t~mem21.base| (_ bv0 32)))} is VALID [2018-11-14 18:25:42,029 INFO L256 TraceCheckUtils]: 14: Hoare triple {1704#(not (= |main_#t~mem21.base| (_ bv0 32)))} call check_queue(#t~mem21.base, #t~mem21.offset); {1656#true} is VALID [2018-11-14 18:25:42,030 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {1711#(= |check_queue_#in~q.base| check_queue_~n~0.base)} is VALID [2018-11-14 18:25:42,030 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#(= |check_queue_#in~q.base| check_queue_~n~0.base)} assume true; {1711#(= |check_queue_#in~q.base| check_queue_~n~0.base)} is VALID [2018-11-14 18:25:42,031 INFO L273 TraceCheckUtils]: 17: Hoare triple {1711#(= |check_queue_#in~q.base| check_queue_~n~0.base)} assume !(~n~0.base != 0bv32 || ~n~0.offset != 0bv32); {1718#(= |check_queue_#in~q.base| (_ bv0 32))} is VALID [2018-11-14 18:25:42,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {1718#(= |check_queue_#in~q.base| (_ bv0 32))} assume true; {1718#(= |check_queue_#in~q.base| (_ bv0 32))} is VALID [2018-11-14 18:25:42,033 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1718#(= |check_queue_#in~q.base| (_ bv0 32))} {1704#(not (= |main_#t~mem21.base| (_ bv0 32)))} #101#return; {1657#false} is VALID [2018-11-14 18:25:42,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {1657#false} havoc #t~mem21.base, #t~mem21.offset; {1657#false} is VALID [2018-11-14 18:25:42,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {1657#false} assume true; {1657#false} is VALID [2018-11-14 18:25:42,034 INFO L273 TraceCheckUtils]: 22: Hoare triple {1657#false} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {1657#false} is VALID [2018-11-14 18:25:42,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {1657#false} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {1657#false} is VALID [2018-11-14 18:25:42,035 INFO L256 TraceCheckUtils]: 24: Hoare triple {1657#false} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {1657#false} is VALID [2018-11-14 18:25:42,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {1657#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {1657#false} is VALID [2018-11-14 18:25:42,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {1657#false} assume true; {1657#false} is VALID [2018-11-14 18:25:42,036 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1657#false} {1657#false} #97#return; {1657#false} is VALID [2018-11-14 18:25:42,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {1657#false} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {1657#false} is VALID [2018-11-14 18:25:42,036 INFO L256 TraceCheckUtils]: 29: Hoare triple {1657#false} call check_queue(#t~mem21.base, #t~mem21.offset); {1657#false} is VALID [2018-11-14 18:25:42,036 INFO L273 TraceCheckUtils]: 30: Hoare triple {1657#false} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {1657#false} is VALID [2018-11-14 18:25:42,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {1657#false} assume true; {1657#false} is VALID [2018-11-14 18:25:42,037 INFO L273 TraceCheckUtils]: 32: Hoare triple {1657#false} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {1657#false} is VALID [2018-11-14 18:25:42,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {1657#false} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {1657#false} is VALID [2018-11-14 18:25:42,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {1657#false} assume !false; {1657#false} is VALID [2018-11-14 18:25:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:25:42,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:25:42,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:25:42,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 18:25:42,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 18:25:42,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:25:42,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:25:42,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:42,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:25:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:25:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:25:42,089 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 9 states. [2018-11-14 18:25:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:43,763 INFO L93 Difference]: Finished difference Result 188 states and 233 transitions. [2018-11-14 18:25:43,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:25:43,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 18:25:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:25:43,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:25:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2018-11-14 18:25:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:25:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2018-11-14 18:25:43,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 113 transitions. [2018-11-14 18:25:43,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:25:43,937 INFO L225 Difference]: With dead ends: 188 [2018-11-14 18:25:43,937 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 18:25:43,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:25:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 18:25:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-11-14 18:25:44,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:25:44,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 105 states. [2018-11-14 18:25:44,181 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 105 states. [2018-11-14 18:25:44,181 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 105 states. [2018-11-14 18:25:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:44,187 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-11-14 18:25:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2018-11-14 18:25:44,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:44,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:44,189 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 114 states. [2018-11-14 18:25:44,189 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 114 states. [2018-11-14 18:25:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:25:44,194 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-11-14 18:25:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2018-11-14 18:25:44,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:25:44,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:25:44,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:25:44,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:25:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 18:25:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2018-11-14 18:25:44,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 35 [2018-11-14 18:25:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:25:44,201 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2018-11-14 18:25:44,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:25:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2018-11-14 18:25:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:25:44,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:25:44,202 INFO L375 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, 1, 1, 1, 1] [2018-11-14 18:25:44,202 INFO L423 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:25:44,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:25:44,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1597698415, now seen corresponding path program 1 times [2018-11-14 18:25:44,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:25:44,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:25:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:25:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:25:44,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:25:44,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:25:44,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-14 18:25:44,464 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:25:44,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 18:25:44,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:44,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:44,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:44,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:44,509 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-14 18:25:44,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:44,798 INFO L303 Elim1Store]: Index analysis took 181 ms [2018-11-14 18:25:44,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 18:25:44,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:25:44,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:45,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 18:25:45,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:47,028 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-11-14 18:25:47,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 18:25:47,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-14 18:25:47,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:47,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 18:25:47,583 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:47,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:25:48,504 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-14 18:25:48,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-14 18:25:48,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-14 18:25:48,566 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:48,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-14 18:25:48,999 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:49,079 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-14 18:25:49,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-14 18:25:49,334 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-14 18:25:49,633 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:49,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-14 18:25:50,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-14 18:25:50,064 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:50,093 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:50,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-14 18:25:50,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 25 treesize of output 28 [2018-11-14 18:25:50,358 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:50,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-14 18:25:50,538 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:50,585 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:25:50,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-14 18:25:50,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-14 18:25:50,817 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:51,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-14 18:25:51,073 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-14 18:25:51,097 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:51,115 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:51,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:25:51,134 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 3 variables, input treesize:88, output treesize:24 [2018-11-14 18:25:53,269 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:53,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:25:53,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:25:53,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-14 18:25:53,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-14 18:25:53,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2018-11-14 18:25:53,477 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:53,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:25:53,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 18:25:53,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:25:53,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 18:25:53,587 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:25:53,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-14 18:25:53,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2388#true} is VALID [2018-11-14 18:25:53,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:25:53,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #103#return; {2388#true} is VALID [2018-11-14 18:25:53,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret22 := main(); {2388#true} is VALID [2018-11-14 18:25:53,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume true; {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {2408#(and (= (_ bv1 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,626 INFO L256 TraceCheckUtils]: 9: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {2388#true} is VALID [2018-11-14 18:25:53,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {2388#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {2388#true} is VALID [2018-11-14 18:25:53,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:25:53,627 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2388#true} {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} #97#return; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,628 INFO L256 TraceCheckUtils]: 14: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} call check_queue(#t~mem21.base, #t~mem21.offset); {2388#true} is VALID [2018-11-14 18:25:53,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {2388#true} is VALID [2018-11-14 18:25:53,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:25:53,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {2388#true} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {2388#true} is VALID [2018-11-14 18:25:53,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2388#true} assume !!~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {2388#true} is VALID [2018-11-14 18:25:53,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {2388#true} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);~n~0.base, ~n~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2388#true} is VALID [2018-11-14 18:25:53,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:25:53,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {2388#true} assume !(~n~0.base != 0bv32 || ~n~0.offset != 0bv32); {2388#true} is VALID [2018-11-14 18:25:53,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:25:53,630 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2388#true} {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} #101#return; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} havoc #t~mem21.base, #t~mem21.offset; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume true; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {2418#(and (= (_ bv2 32) main_~next_time~0) (= (_ bv0 32) |main_~#queue~0.offset|))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {2476#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,636 INFO L256 TraceCheckUtils]: 28: Hoare triple {2476#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {2480#(exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:25:53,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {2480#(exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {2484#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} is VALID [2018-11-14 18:25:53,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {2484#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} assume true; {2484#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} is VALID [2018-11-14 18:25:53,648 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2484#(and (= (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) |append_to_queue_#in~n.base|) (exists ((v_main_~new_process~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~new_process~0.base_BEFORE_CALL_6) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32))) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} {2476#(and (= (bvadd (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) main_~new_process~0.offset) (= (_ bv0 32) |main_~#queue~0.offset|))} #97#return; {2491#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|))} is VALID [2018-11-14 18:25:53,649 INFO L273 TraceCheckUtils]: 32: Hoare triple {2491#(and (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= (_ bv0 32) |main_~#queue~0.offset|))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {2495#(and (= (bvadd (select (select |#memory_int| |main_#t~mem21.base|) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~mem21.offset| (_ bv0 32)))} is VALID [2018-11-14 18:25:53,650 INFO L256 TraceCheckUtils]: 33: Hoare triple {2495#(and (= (bvadd (select (select |#memory_int| |main_#t~mem21.base|) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~mem21.offset| (_ bv0 32)))} call check_queue(#t~mem21.base, #t~mem21.offset); {2499#(and (= (_ bv0 32) |check_queue_#in~q.offset|) (= (_ bv2 32) (select (select |#memory_int| |check_queue_#in~q.base|) (_ bv4 32))))} is VALID [2018-11-14 18:25:53,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {2499#(and (= (_ bv0 32) |check_queue_#in~q.offset|) (= (_ bv2 32) (select (select |#memory_int| |check_queue_#in~q.base|) (_ bv4 32))))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {2503#(and (= (_ bv2 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:25:53,651 INFO L273 TraceCheckUtils]: 35: Hoare triple {2503#(and (= (_ bv2 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} assume true; {2503#(and (= (_ bv2 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} is VALID [2018-11-14 18:25:53,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {2503#(and (= (_ bv2 32) (select (select |#memory_int| check_queue_~n~0.base) (_ bv4 32))) (= (_ bv0 32) check_queue_~n~0.offset))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {2510#(= (bvadd |check_queue_#t~mem11| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:25:53,653 INFO L273 TraceCheckUtils]: 37: Hoare triple {2510#(= (bvadd |check_queue_#t~mem11| (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {2389#false} is VALID [2018-11-14 18:25:53,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-14 18:25:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:25:53,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:25:56,126 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:25:56,454 WARN L179 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:25:56,908 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 18:25:57,253 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 18:26:01,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-14 18:26:01,883 INFO L273 TraceCheckUtils]: 37: Hoare triple {2520#(bvsge |check_queue_#t~mem11| (_ bv1 32))} assume !~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {2389#false} is VALID [2018-11-14 18:26:01,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {2524#(bvsge (select (select |#memory_int| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv4 32))) (_ bv1 32))} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {2520#(bvsge |check_queue_#t~mem11| (_ bv1 32))} is VALID [2018-11-14 18:26:01,884 INFO L273 TraceCheckUtils]: 35: Hoare triple {2524#(bvsge (select (select |#memory_int| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv4 32))) (_ bv1 32))} assume true; {2524#(bvsge (select (select |#memory_int| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:01,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {2531#(bvsge (select (select |#memory_int| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv4 32))) (_ bv1 32))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {2524#(bvsge (select (select |#memory_int| check_queue_~n~0.base) (bvadd check_queue_~n~0.offset (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:01,887 INFO L256 TraceCheckUtils]: 33: Hoare triple {2535#(bvsge (select (select |#memory_int| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv4 32))) (_ bv1 32))} call check_queue(#t~mem21.base, #t~mem21.offset); {2531#(bvsge (select (select |#memory_int| |check_queue_#in~q.base|) (bvadd |check_queue_#in~q.offset| (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:01,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {2539#(bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv4 32))) (_ bv1 32))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {2535#(bvsge (select (select |#memory_int| |main_#t~mem21.base|) (bvadd |main_#t~mem21.offset| (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:01,893 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2547#(or (bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv4 32))) (_ bv1 32)) (not (bvsge (select (select |#memory_int| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv4 32))) (_ bv1 32))))} {2543#(bvsge (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv1 32))} #97#return; {2539#(bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|) (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:01,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#(or (bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv4 32))) (_ bv1 32)) (not (bvsge (select (select |#memory_int| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv4 32))) (_ bv1 32))))} assume true; {2547#(or (bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv4 32))) (_ bv1 32)) (not (bvsge (select (select |#memory_int| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv4 32))) (_ bv1 32))))} is VALID [2018-11-14 18:26:03,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {2388#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {2547#(or (bvsge (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (bvadd (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|) (_ bv4 32))) (_ bv1 32)) (not (bvsge (select (select |#memory_int| |append_to_queue_#in~n.base|) (bvadd |append_to_queue_#in~n.offset| (_ bv4 32))) (_ bv1 32))))} is UNKNOWN [2018-11-14 18:26:03,897 INFO L256 TraceCheckUtils]: 28: Hoare triple {2543#(bvsge (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv1 32))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {2388#true} is VALID [2018-11-14 18:26:03,900 INFO L273 TraceCheckUtils]: 27: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {2543#(bvsge (select (select |#memory_int| main_~new_process~0.base) (bvadd main_~new_process~0.offset (_ bv4 32))) (_ bv1 32))} is VALID [2018-11-14 18:26:03,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} assume true; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} havoc #t~mem21.base, #t~mem21.offset; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,903 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2388#true} {2557#(bvsge main_~next_time~0 (_ bv1 32))} #101#return; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,903 INFO L273 TraceCheckUtils]: 22: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:26:03,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {2388#true} assume !(~n~0.base != 0bv32 || ~n~0.offset != 0bv32); {2388#true} is VALID [2018-11-14 18:26:03,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:26:03,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {2388#true} call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);~n~0.base, ~n~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2388#true} is VALID [2018-11-14 18:26:03,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {2388#true} assume !!~bvsge32(#t~mem11, 1bv32);havoc #t~mem11; {2388#true} is VALID [2018-11-14 18:26:03,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {2388#true} assume !!(~n~0.base != 0bv32 || ~n~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32); {2388#true} is VALID [2018-11-14 18:26:03,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:26:03,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#true} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {2388#true} is VALID [2018-11-14 18:26:03,906 INFO L256 TraceCheckUtils]: 14: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} call check_queue(#t~mem21.base, #t~mem21.offset); {2388#true} is VALID [2018-11-14 18:26:03,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4bv32); {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,907 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {2388#true} {2557#(bvsge main_~next_time~0 (_ bv1 32))} #97#return; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:26:03,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {2388#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~q.base, ~q.offset := #in~q.base, #in~q.offset;call #t~mem2.base, #t~mem2.offset := read~$Pointer$(~q.base, ~q.offset, 4bv32);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~bvadd32(8bv32, ~n.offset), 4bv32);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4bv32); {2388#true} is VALID [2018-11-14 18:26:03,908 INFO L256 TraceCheckUtils]: 9: Hoare triple {2557#(bvsge main_~next_time~0 (_ bv1 32))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {2388#true} is VALID [2018-11-14 18:26:03,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} assume ~bvslt32(~next_time~0, 1000bv32) && #t~nondet13 != 0bv32;havoc #t~nondet13;~new_id~0 := #t~nondet14;havoc #t~nondet14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.alloc(12bv32);~new_process~0.base, ~new_process~0.offset := #t~malloc15.base, #t~malloc15.offset;call write~intINTTYPE4(#t~nondet16, ~new_process~0.base, ~new_process~0.offset, 4bv32);havoc #t~nondet16;#t~post17 := ~next_time~0;~next_time~0 := ~bvadd32(1bv32, #t~post17);call write~intINTTYPE4(#t~post17, ~new_process~0.base, ~bvadd32(4bv32, ~new_process~0.offset), 4bv32);havoc #t~post17; {2557#(bvsge main_~next_time~0 (_ bv1 32))} is VALID [2018-11-14 18:26:03,909 INFO L273 TraceCheckUtils]: 7: Hoare triple {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} assume !!(#t~nondet12 != 0bv32);havoc #t~nondet12; {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-14 18:26:03,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} assume true; {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-14 18:26:03,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~#queue~0.base, ~#queue~0.offset, 4bv32);~next_time~0 := 1bv32; {2615#(bvsge (bvadd main_~next_time~0 (_ bv1 32)) (_ bv1 32))} is VALID [2018-11-14 18:26:03,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret22 := main(); {2388#true} is VALID [2018-11-14 18:26:03,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #103#return; {2388#true} is VALID [2018-11-14 18:26:03,911 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 18:26:03,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2388#true} is VALID [2018-11-14 18:26:03,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-14 18:26:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 18:26:03,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:26:03,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-14 18:26:03,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-11-14 18:26:03,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:26:03,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states.