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_Default-Const.epf -i ../../../trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:16:07,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:16:07,223 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:16:07,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:16:07,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:16:07,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:16:07,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:16:07,240 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:16:07,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:16:07,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:16:07,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:16:07,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:16:07,245 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:16:07,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:16:07,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:16:07,248 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:16:07,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:16:07,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:16:07,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:16:07,255 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:16:07,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:16:07,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:16:07,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:16:07,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:16:07,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:16:07,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:16:07,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:16:07,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:16:07,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:16:07,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:16:07,267 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:16:07,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:16:07,268 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:16:07,268 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:16:07,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:16:07,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:16:07,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:16:07,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:16:07,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:16:07,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:16:07,289 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:16:07,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:16:07,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:16:07,290 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:16:07,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:16:07,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:16:07,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:16:07,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:16:07,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:16:07,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:16:07,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:16:07,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:16:07,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:16:07,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:16:07,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:16:07,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:16:07,294 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:16:07,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:16:07,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:16:07,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:16:07,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:16:07,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:16:07,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:16:07,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:16:07,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:16:07,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:16:07,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:16:07,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:16:07,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:16:07,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:16:07,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:16:07,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:16:07,377 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:16:07,378 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 19:16:07,450 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f974be2a/7c4a58d836ff436bbd6cf8183d65e01c/FLAGfa0daec21 [2018-11-14 19:16:08,012 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:16:08,013 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue_true-unreach-call.i [2018-11-14 19:16:08,039 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f974be2a/7c4a58d836ff436bbd6cf8183d65e01c/FLAGfa0daec21 [2018-11-14 19:16:08,058 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f974be2a/7c4a58d836ff436bbd6cf8183d65e01c [2018-11-14 19:16:08,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:16:08,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:16:08,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:08,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:16:08,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:16:08,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587d4353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08, skipping insertion in model container [2018-11-14 19:16:08,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:16:08,154 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:16:08,600 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:08,622 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:16:08,685 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:16:08,870 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:16:08,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08 WrapperNode [2018-11-14 19:16:08,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:16:08,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:16:08,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:16:08,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:16:08,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (1/1) ... [2018-11-14 19:16:08,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:16:08,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:16:08,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:16:08,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:16:08,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (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 19:16:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:16:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:16:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:16:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:16:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-14 19:16:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2018-11-14 19:16:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2018-11-14 19:16:09,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:16:09,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:16:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:16:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:16:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:16:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:16:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:16:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:16:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:16:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:16:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:16:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:16:09,031 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:16:09,032 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:16:09,033 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:16:09,034 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:16:09,035 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:16:09,036 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:16:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:16:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:16:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:16:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:16:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:16:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:16:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:16:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:16:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:16:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:16:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:16:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:16:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:16:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:16:09,039 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:16:09,040 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:16:09,041 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:16:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:16:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:16:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:16:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2018-11-14 19:16:09,042 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:16:09,043 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2018-11-14 19:16:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:16:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:16:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:16:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:16:09,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:16:09,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:16:10,274 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:16:10,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:10 BoogieIcfgContainer [2018-11-14 19:16:10,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:16:10,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:16:10,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:16:10,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:16:10,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:16:08" (1/3) ... [2018-11-14 19:16:10,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a84b397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:10, skipping insertion in model container [2018-11-14 19:16:10,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:16:08" (2/3) ... [2018-11-14 19:16:10,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a84b397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:16:10, skipping insertion in model container [2018-11-14 19:16:10,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:16:10" (3/3) ... [2018-11-14 19:16:10,282 INFO L112 eAbstractionObserver]: Analyzing ICFG process_queue_true-unreach-call.i [2018-11-14 19:16:10,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:16:10,298 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:16:10,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:16:10,351 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:16:10,352 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:16:10,352 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:16:10,352 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:16:10,352 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:16:10,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:16:10,353 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:16:10,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:16:10,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:16:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-14 19:16:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:16:10,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:10,386 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:16:10,389 INFO L423 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:10,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -835037313, now seen corresponding path program 1 times [2018-11-14 19:16:10,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:10,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:10,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:10,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:10,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:10,893 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-14 19:16:11,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2018-11-14 19:16:11,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47#true} is VALID [2018-11-14 19:16:11,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2018-11-14 19:16:11,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #110#return; {47#true} is VALID [2018-11-14 19:16:11,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret23 := main(); {47#true} is VALID [2018-11-14 19:16:11,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {47#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);call write~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);~next_time~0 := 1; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume true; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !!(#t~nondet12 != 0);havoc #t~nondet12;#t~short14 := ~next_time~0 < 1000; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume #t~short14;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;#t~short14 := #t~nondet13 != 0; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !#t~short14;havoc #t~short14;havoc #t~nondet13; {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} assume !(~next_time~0 > 1); {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:11,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#(and (= 0 (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4); {50#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|))} is VALID [2018-11-14 19:16:11,516 INFO L256 TraceCheckUtils]: 13: Hoare triple {50#(and (= 0 |main_#t~mem22.base|) (= 0 |main_#t~mem22.offset|))} call check_queue(#t~mem22.base, #t~mem22.offset); {51#(and (= 0 |check_queue_#in~q.offset|) (= 0 |check_queue_#in~q.base|))} is VALID [2018-11-14 19:16:11,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {51#(and (= 0 |check_queue_#in~q.offset|) (= 0 |check_queue_#in~q.base|))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {52#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} is VALID [2018-11-14 19:16:11,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {52#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} assume true; {52#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} is VALID [2018-11-14 19:16:11,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {52#(and (= check_queue_~n~0.offset 0) (= 0 check_queue_~n~0.base))} assume !!(~n~0.base != 0 || ~n~0.offset != 0);call #t~mem11 := read~int(~n~0.base, ~n~0.offset + 4, 4); {48#false} is VALID [2018-11-14 19:16:11,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {48#false} assume !(#t~mem11 >= 1);havoc #t~mem11; {48#false} is VALID [2018-11-14 19:16:11,533 INFO L273 TraceCheckUtils]: 18: Hoare triple {48#false} assume !false; {48#false} is VALID [2018-11-14 19:16:11,539 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 19:16:11,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:11,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 19:16:11,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:16:11,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:11,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:16:11,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:11,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:16:11,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:16:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:16:11,700 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 6 states. [2018-11-14 19:16:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:12,612 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2018-11-14 19:16:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:16:12,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 19:16:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 19:16:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:16:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2018-11-14 19:16:12,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 134 transitions. [2018-11-14 19:16:12,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:12,922 INFO L225 Difference]: With dead ends: 99 [2018-11-14 19:16:12,922 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 19:16:12,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:16:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 19:16:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-14 19:16:12,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:12,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-14 19:16:12,997 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-14 19:16:12,997 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-14 19:16:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:13,006 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-14 19:16:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-14 19:16:13,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:13,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:13,008 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-14 19:16:13,008 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-14 19:16:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:13,015 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-11-14 19:16:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-14 19:16:13,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:13,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:13,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:13,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 19:16:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-14 19:16:13,024 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 19 [2018-11-14 19:16:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:13,024 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-14 19:16:13,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:16:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-14 19:16:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 19:16:13,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:13,026 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, 1, 1] [2018-11-14 19:16:13,027 INFO L423 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:13,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:13,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1460054307, now seen corresponding path program 1 times [2018-11-14 19:16:13,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:13,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:13,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-14 19:16:13,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {366#true} is VALID [2018-11-14 19:16:13,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-14 19:16:13,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #110#return; {366#true} is VALID [2018-11-14 19:16:13,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret23 := main(); {366#true} is VALID [2018-11-14 19:16:13,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#queue~0.base, ~#queue~0.offset := #Ultimate.alloc(4);call write~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);call write~$Pointer$(0, 0, ~#queue~0.base, ~#queue~0.offset, 4);~next_time~0 := 1; {368#(= 1 main_~next_time~0)} is VALID [2018-11-14 19:16:13,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {368#(= 1 main_~next_time~0)} assume true; {368#(= 1 main_~next_time~0)} is VALID [2018-11-14 19:16:13,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {368#(= 1 main_~next_time~0)} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647; {368#(= 1 main_~next_time~0)} is VALID [2018-11-14 19:16:13,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(= 1 main_~next_time~0)} assume !!(#t~nondet12 != 0);havoc #t~nondet12;#t~short14 := ~next_time~0 < 1000; {368#(= 1 main_~next_time~0)} is VALID [2018-11-14 19:16:13,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {368#(= 1 main_~next_time~0)} assume #t~short14;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;#t~short14 := #t~nondet13 != 0; {368#(= 1 main_~next_time~0)} is VALID [2018-11-14 19:16:13,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {368#(= 1 main_~next_time~0)} assume #t~short14;havoc #t~short14;havoc #t~nondet13;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~new_id~0 := #t~nondet15;havoc #t~nondet15;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.alloc(12);~new_process~0.base, ~new_process~0.offset := #t~malloc16.base, #t~malloc16.offset;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, ~new_process~0.base, ~new_process~0.offset + 0, 4);havoc #t~nondet17;#t~post18 := ~next_time~0;~next_time~0 := #t~post18 + 1;call write~int(#t~post18, ~new_process~0.base, ~new_process~0.offset + 4, 4);havoc #t~post18; {369#(and (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (= 0 main_~new_process~0.offset))} is VALID [2018-11-14 19:16:13,613 INFO L256 TraceCheckUtils]: 11: Hoare triple {369#(and (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (= 0 main_~new_process~0.offset))} call append_to_queue(~new_process~0.base, ~new_process~0.offset, ~#queue~0.base, ~#queue~0.offset); {366#true} is VALID [2018-11-14 19:16:13,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {366#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, 4);call write~$Pointer$(#t~mem2.base, #t~mem2.offset, ~n.base, ~n.offset + 8, 4);havoc #t~mem2.base, #t~mem2.offset;call write~$Pointer$(~n.base, ~n.offset, ~q.base, ~q.offset, 4); {370#(and (= |append_to_queue_#in~n.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= |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 19:16:13,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {370#(and (= |append_to_queue_#in~n.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= |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; {370#(and (= |append_to_queue_#in~n.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= |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 19:16:13,619 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {370#(and (= |append_to_queue_#in~n.base| (select (select |#memory_$Pointer$.base| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)) (= |append_to_queue_#in~n.offset| (select (select |#memory_$Pointer$.offset| |append_to_queue_#in~q.base|) |append_to_queue_#in~q.offset|)))} {369#(and (= 1 (select (select |#memory_int| main_~new_process~0.base) (+ main_~new_process~0.offset 4))) (= 0 main_~new_process~0.offset))} #104#return; {371#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} is VALID [2018-11-14 19:16:13,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {371#(and (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#queue~0.base|) |main_~#queue~0.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#queue~0.base|) |main_~#queue~0.offset|)))} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~#queue~0.base, ~#queue~0.offset, 4); {372#(and (= 1 (select (select |#memory_int| |main_#t~mem22.base|) 4)) (= 0 |main_#t~mem22.offset|))} is VALID [2018-11-14 19:16:13,622 INFO L256 TraceCheckUtils]: 16: Hoare triple {372#(and (= 1 (select (select |#memory_int| |main_#t~mem22.base|) 4)) (= 0 |main_#t~mem22.offset|))} call check_queue(#t~mem22.base, #t~mem22.offset); {373#(and (= 0 |check_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |check_queue_#in~q.base|) 4)))} is VALID [2018-11-14 19:16:13,623 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#(and (= 0 |check_queue_#in~q.offset|) (= 1 (select (select |#memory_int| |check_queue_#in~q.base|) 4)))} ~q.base, ~q.offset := #in~q.base, #in~q.offset;~n~0.base, ~n~0.offset := ~q.base, ~q.offset; {374#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (= check_queue_~n~0.offset 0))} is VALID [2018-11-14 19:16:13,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {374#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (= check_queue_~n~0.offset 0))} assume true; {374#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (= check_queue_~n~0.offset 0))} is VALID [2018-11-14 19:16:13,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {374#(and (= 1 (select (select |#memory_int| check_queue_~n~0.base) (+ check_queue_~n~0.offset 4))) (= check_queue_~n~0.offset 0))} assume !!(~n~0.base != 0 || ~n~0.offset != 0);call #t~mem11 := read~int(~n~0.base, ~n~0.offset + 4, 4); {375#(= |check_queue_#t~mem11| 1)} is VALID [2018-11-14 19:16:13,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {375#(= |check_queue_#t~mem11| 1)} assume !(#t~mem11 >= 1);havoc #t~mem11; {367#false} is VALID [2018-11-14 19:16:13,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-14 19:16:13,631 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 19:16:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:16:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 19:16:13,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 19:16:13,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:16:13,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:16:13,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:13,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:16:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:16:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:16:13,676 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 10 states. [2018-11-14 19:16:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,397 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2018-11-14 19:16:15,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:16:15,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 19:16:15,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:16:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:16:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2018-11-14 19:16:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:16:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2018-11-14 19:16:15,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2018-11-14 19:16:15,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:16:15,650 INFO L225 Difference]: With dead ends: 112 [2018-11-14 19:16:15,651 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 19:16:15,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:16:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 19:16:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-14 19:16:15,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:16:15,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 73 states. [2018-11-14 19:16:15,764 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 73 states. [2018-11-14 19:16:15,764 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 73 states. [2018-11-14 19:16:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,770 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-14 19:16:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2018-11-14 19:16:15,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:15,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:15,772 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 79 states. [2018-11-14 19:16:15,772 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 79 states. [2018-11-14 19:16:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:16:15,779 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2018-11-14 19:16:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2018-11-14 19:16:15,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:16:15,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:16:15,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:16:15,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:16:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 19:16:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2018-11-14 19:16:15,786 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 22 [2018-11-14 19:16:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:16:15,786 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2018-11-14 19:16:15,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:16:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-14 19:16:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 19:16:15,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:16:15,788 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, 1, 1] [2018-11-14 19:16:15,788 INFO L423 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:16:15,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:16:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1403346340, now seen corresponding path program 1 times [2018-11-14 19:16:15,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:16:15,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:16:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:16:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:16:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:16:16,102 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:16:16,107 INFO L168 Benchmark]: Toolchain (without parser) took 8038.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -306.9 MB). Peak memory consumption was 408.2 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:16,109 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:16:16,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.3 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:16,110 INFO L168 Benchmark]: Boogie Preprocessor took 79.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:16,111 INFO L168 Benchmark]: RCFGBuilder took 1322.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:16,112 INFO L168 Benchmark]: TraceAbstraction took 5830.49 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 386.9 MB). Peak memory consumption was 386.9 MB. Max. memory is 7.1 GB. [2018-11-14 19:16:16,116 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.00 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.3 MB). Peak memory consumption was 38.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1322.66 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 65.8 MB). Peak memory consumption was 65.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5830.49 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 386.9 MB). Peak memory consumption was 386.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...