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.epf -i ../../../trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:34:35,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:34:35,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:34:35,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:34:35,626 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:34:35,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:34:35,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:34:35,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:34:35,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:34:35,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:34:35,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:34:35,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:34:35,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:34:35,643 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:34:35,644 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:34:35,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:34:35,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:34:35,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:34:35,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:34:35,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:34:35,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:34:35,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:34:35,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:34:35,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:34:35,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:34:35,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:34:35,671 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:34:35,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:34:35,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:34:35,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:34:35,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:34:35,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:34:35,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:34:35,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:34:35,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:34:35,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:34:35,683 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:34:35,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:34:35,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:34:35,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:34:35,715 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:34:35,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:34:35,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:34:35,716 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:34:35,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:34:35,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:34:35,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:34:35,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:34:35,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:34:35,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:34:35,718 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:34:35,719 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:34:35,719 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:34:35,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:34:35,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:34:35,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:34:35,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:34:35,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:34:35,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:34:35,720 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:34:35,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:34:35,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:34:35,721 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:34:35,721 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:34:35,721 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:34:35,722 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:34:35,722 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:34:35,722 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:34:35,722 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:34:35,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:34:35,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:34:35,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:34:35,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:34:35,789 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:34:35,789 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i [2018-11-14 16:34:35,864 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40aadb858/f80c979425574f09b6d71b0a169ff892/FLAG50da3a2a5 [2018-11-14 16:34:36,393 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:34:36,398 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/quick_sort_split_true-unreach-call.i [2018-11-14 16:34:36,424 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40aadb858/f80c979425574f09b6d71b0a169ff892/FLAG50da3a2a5 [2018-11-14 16:34:36,440 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40aadb858/f80c979425574f09b6d71b0a169ff892 [2018-11-14 16:34:36,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:34:36,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:34:36,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:34:36,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:34:36,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:34:36,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:36" (1/1) ... [2018-11-14 16:34:36,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c60f040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:36, skipping insertion in model container [2018-11-14 16:34:36,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:34:36" (1/1) ... [2018-11-14 16:34:36,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:34:36,521 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:34:36,934 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:34:36,951 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:34:37,004 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:34:37,071 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:34:37,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37 WrapperNode [2018-11-14 16:34:37,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:34:37,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:34:37,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:34:37,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:34:37,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (1/1) ... [2018-11-14 16:34:37,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:34:37,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:34:37,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:34:37,304 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:34:37,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (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 16:34:37,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:34:37,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:34:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:34:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:34:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2018-11-14 16:34:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure create_list [2018-11-14 16:34:37,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:34:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:34:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:34:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:34:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:34:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:34:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:34:37,359 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:34:37,360 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:34:37,361 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:34:37,362 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:34:37,363 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:34:37,364 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:34:37,365 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:34:37,366 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:34:37,367 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:34:37,368 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:34:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:34:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:34:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:34:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:34:37,369 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:34:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:34:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:34:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:34:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:34:37,370 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:34:37,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:34:37,372 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:34:37,373 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:34:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:34:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:34:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:34:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:34:37,374 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:34:37,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure create_list [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:34:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:34:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:34:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:34:38,388 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:34:38,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:38 BoogieIcfgContainer [2018-11-14 16:34:38,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:34:38,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:34:38,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:34:38,393 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:34:38,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:34:36" (1/3) ... [2018-11-14 16:34:38,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b24f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:38, skipping insertion in model container [2018-11-14 16:34:38,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:34:37" (2/3) ... [2018-11-14 16:34:38,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b24f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:34:38, skipping insertion in model container [2018-11-14 16:34:38,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:34:38" (3/3) ... [2018-11-14 16:34:38,397 INFO L112 eAbstractionObserver]: Analyzing ICFG quick_sort_split_true-unreach-call.i [2018-11-14 16:34:38,407 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:34:38,423 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-14 16:34:38,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-14 16:34:38,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:34:38,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:34:38,478 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:34:38,478 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:34:38,478 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:34:38,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:34:38,479 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:34:38,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:34:38,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:34:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-14 16:34:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 16:34:38,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:38,506 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 16:34:38,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:38,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 86346705, now seen corresponding path program 1 times [2018-11-14 16:34:38,520 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:38,520 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 16:34:38,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:38,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:38,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {42#true} is VALID [2018-11-14 16:34:38,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {42#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {42#true} is VALID [2018-11-14 16:34:38,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2018-11-14 16:34:38,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #107#return; {42#true} is VALID [2018-11-14 16:34:38,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret15 := main(); {42#true} is VALID [2018-11-14 16:34:38,716 INFO L256 TraceCheckUtils]: 5: Hoare triple {42#true} call #t~ret7.base, #t~ret7.offset := create_list(); {42#true} is VALID [2018-11-14 16:34:38,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {42#true} is VALID [2018-11-14 16:34:38,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#true} assume !true; {43#false} is VALID [2018-11-14 16:34:38,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#false} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {43#false} is VALID [2018-11-14 16:34:38,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2018-11-14 16:34:38,718 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #101#return; {43#false} is VALID [2018-11-14 16:34:38,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#false} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {43#false} is VALID [2018-11-14 16:34:38,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2018-11-14 16:34:38,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#false} assume true; {43#false} is VALID [2018-11-14 16:34:38,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#false} assume !!(~low~0.base != 0bv32 || ~low~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~low~0.base, ~low~0.offset, 4bv32); {43#false} is VALID [2018-11-14 16:34:38,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#false} assume !(#t~mem11 == 4294967295bv32);havoc #t~mem11; {43#false} is VALID [2018-11-14 16:34:38,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#false} assume !false; {43#false} is VALID [2018-11-14 16:34:38,725 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 16:34:38,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:38,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:38,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:34:38,735 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 16:34:38,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:38,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:34:38,799 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 16:34:38,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:34:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:34:38,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:34:38,812 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-11-14 16:34:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:39,392 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2018-11-14 16:34:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:34:39,393 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 16:34:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:34:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2018-11-14 16:34:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:34:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2018-11-14 16:34:39,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2018-11-14 16:34:39,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:39,861 INFO L225 Difference]: With dead ends: 63 [2018-11-14 16:34:39,861 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 16:34:39,864 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:34:39,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 16:34:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 16:34:39,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:39,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 16:34:39,936 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:34:39,937 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:34:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:39,944 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 16:34:39,944 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 16:34:39,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:39,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:39,945 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 16:34:39,945 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 16:34:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:39,951 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 16:34:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 16:34:39,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:39,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:39,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:39,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 16:34:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 16:34:39,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2018-11-14 16:34:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:39,959 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 16:34:39,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:34:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 16:34:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:34:39,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:39,961 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 16:34:39,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:39,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1835446684, now seen corresponding path program 1 times [2018-11-14 16:34:39,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:39,962 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 16:34:39,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:40,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:40,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {283#true} is VALID [2018-11-14 16:34:40,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {283#true} is VALID [2018-11-14 16:34:40,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2018-11-14 16:34:40,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #107#return; {283#true} is VALID [2018-11-14 16:34:40,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret15 := main(); {283#true} is VALID [2018-11-14 16:34:40,200 INFO L256 TraceCheckUtils]: 5: Hoare triple {283#true} call #t~ret7.base, #t~ret7.offset := create_list(); {283#true} is VALID [2018-11-14 16:34:40,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {283#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {283#true} is VALID [2018-11-14 16:34:40,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {283#true} assume true; {283#true} is VALID [2018-11-14 16:34:40,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {283#true} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {283#true} is VALID [2018-11-14 16:34:40,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {283#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {283#true} is VALID [2018-11-14 16:34:40,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#true} assume true; {283#true} is VALID [2018-11-14 16:34:40,201 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {283#true} {283#true} #101#return; {283#true} is VALID [2018-11-14 16:34:40,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {283#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-14 16:34:40,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume true; {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-14 16:34:40,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-14 16:34:40,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume true; {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} is VALID [2018-11-14 16:34:40,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {324#(and (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base))} assume !!(~low~0.base != 0bv32 || ~low~0.offset != 0bv32);call #t~mem11 := read~intINTTYPE4(~low~0.base, ~low~0.offset, 4bv32); {284#false} is VALID [2018-11-14 16:34:40,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {284#false} assume !(#t~mem11 == 4294967295bv32);havoc #t~mem11; {284#false} is VALID [2018-11-14 16:34:40,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {284#false} assume !false; {284#false} is VALID [2018-11-14 16:34:40,210 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 16:34:40,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:40,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:34:40,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:34:40,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:40,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:34:40,274 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 16:34:40,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:34:40,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:34:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:34:40,275 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-14 16:34:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:40,531 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-11-14 16:34:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:34:40,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-14 16:34:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:34:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 16:34:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:34:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 16:34:40,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 16:34:40,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:40,654 INFO L225 Difference]: With dead ends: 43 [2018-11-14 16:34:40,654 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 16:34:40,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:34:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 16:34:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 16:34:40,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:40,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 16:34:40,670 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 16:34:40,670 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 16:34:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:40,674 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 16:34:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 16:34:40,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:40,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:40,675 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 16:34:40,675 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 16:34:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:40,678 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-14 16:34:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 16:34:40,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:40,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:40,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:40,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:34:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 16:34:40,683 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 19 [2018-11-14 16:34:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 16:34:40,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:34:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 16:34:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:34:40,685 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:34:40,685 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] [2018-11-14 16:34:40,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:34:40,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:34:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1368766688, now seen corresponding path program 1 times [2018-11-14 16:34:40,686 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:34:40,686 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 16:34:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:34:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:34:40,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:34:40,823 INFO L256 TraceCheckUtils]: 0: Hoare triple {498#true} call ULTIMATE.init(); {498#true} is VALID [2018-11-14 16:34:40,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {498#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {498#true} is VALID [2018-11-14 16:34:40,824 INFO L273 TraceCheckUtils]: 2: Hoare triple {498#true} assume true; {498#true} is VALID [2018-11-14 16:34:40,824 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} #107#return; {498#true} is VALID [2018-11-14 16:34:40,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {498#true} call #t~ret15 := main(); {498#true} is VALID [2018-11-14 16:34:40,825 INFO L256 TraceCheckUtils]: 5: Hoare triple {498#true} call #t~ret7.base, #t~ret7.offset := create_list(); {498#true} is VALID [2018-11-14 16:34:40,825 INFO L273 TraceCheckUtils]: 6: Hoare triple {498#true} call ~#list~0.base, ~#list~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#list~0.base, ~#list~0.offset, 4bv32); {498#true} is VALID [2018-11-14 16:34:40,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {498#true} assume true; {498#true} is VALID [2018-11-14 16:34:40,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {498#true} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {498#true} is VALID [2018-11-14 16:34:40,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {498#true} call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4bv32);#res.base, #res.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset);havoc ~#list~0.base, ~#list~0.offset; {498#true} is VALID [2018-11-14 16:34:40,826 INFO L273 TraceCheckUtils]: 10: Hoare triple {498#true} assume true; {498#true} is VALID [2018-11-14 16:34:40,827 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {498#true} {498#true} #101#return; {498#true} is VALID [2018-11-14 16:34:40,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {498#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset;~low~0.base, ~low~0.offset := 0bv32, 0bv32;~high~0.base, ~high~0.offset := 0bv32, 0bv32;~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume true; {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume true; {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !(~low~0.base != 0bv32 || ~low~0.offset != 0bv32); {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume true; {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} is VALID [2018-11-14 16:34:40,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#(and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset))} assume !!(~high~0.base != 0bv32 || ~high~0.offset != 0bv32);call #t~mem13 := read~intINTTYPE4(~high~0.base, ~high~0.offset, 4bv32); {499#false} is VALID [2018-11-14 16:34:40,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {499#false} assume !(#t~mem13 == 1bv32);havoc #t~mem13; {499#false} is VALID [2018-11-14 16:34:40,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {499#false} assume !false; {499#false} is VALID [2018-11-14 16:34:40,841 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 16:34:40,841 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:34:40,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:34:40,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:34:40,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:34:40,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:34:40,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:34:40,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:40,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:34:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:34:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:34:40,875 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 16:34:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:41,049 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 16:34:41,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:34:41,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:34:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:34:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:34:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-14 16:34:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:34:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-14 16:34:41,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-14 16:34:41,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:34:41,130 INFO L225 Difference]: With dead ends: 33 [2018-11-14 16:34:41,130 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:34:41,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:34:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:34:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:34:41,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:34:41,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:34:41,132 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:34:41,132 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:34:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:41,133 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:34:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:34:41,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:41,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:41,134 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:34:41,134 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:34:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:34:41,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:34:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:34:41,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:41,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:34:41,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:34:41,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:34:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:34:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:34:41,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 16:34:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:34:41,136 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:34:41,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:34:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:34:41,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:34:41,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:34:41,439 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-14 16:34:41,528 INFO L428 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: true [2018-11-14 16:34:41,528 INFO L428 ceAbstractionStarter]: At program point L576-1(lines 571 577) the Hoare annotation is: true [2018-11-14 16:34:41,529 INFO L428 ceAbstractionStarter]: At program point L574(line 574) the Hoare annotation is: true [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 576) no Hoare annotation was computed. [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 577) no Hoare annotation was computed. [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point L571-3(lines 571 577) no Hoare annotation was computed. [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point create_listEXIT(lines 569 579) no Hoare annotation was computed. [2018-11-14 16:34:41,529 INFO L428 ceAbstractionStarter]: At program point create_listENTRY(lines 569 579) the Hoare annotation is: true [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point create_listFINAL(lines 569 579) no Hoare annotation was computed. [2018-11-14 16:34:41,529 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2018-11-14 16:34:41,530 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:34:41,531 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 580 602) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 601) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point L597-2(lines 580 602) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point L597-3(lines 580 602) no Hoare annotation was computed. [2018-11-14 16:34:41,531 INFO L425 ceAbstractionStarter]: For program point L593(lines 593 594) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 594) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L593-2(lines 593 594) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 585 591) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L421 ceAbstractionStarter]: At program point L585-3(lines 585 591) the Hoare annotation is: (and (= main_~high~0.base (_ bv0 32)) (= (_ bv0 32) main_~high~0.offset) (= main_~low~0.offset (_ bv0 32)) (= (_ bv0 32) main_~low~0.base)) [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L581(line 581) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 599) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L598-2(lines 598 599) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-11-14 16:34:41,532 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L425 ceAbstractionStarter]: For program point L586-2(line 586) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 580 602) the Hoare annotation is: true [2018-11-14 16:34:41,533 INFO L425 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L425 ceAbstractionStarter]: For program point L592-2(lines 580 602) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L425 ceAbstractionStarter]: For program point append_to_listEXIT(lines 562 568) no Hoare annotation was computed. [2018-11-14 16:34:41,533 INFO L428 ceAbstractionStarter]: At program point append_to_listENTRY(lines 562 568) the Hoare annotation is: true [2018-11-14 16:34:41,534 INFO L425 ceAbstractionStarter]: For program point append_to_listFINAL(lines 562 568) no Hoare annotation was computed. [2018-11-14 16:34:41,535 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2018-11-14 16:34:41,536 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: append_to_listFINAL has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L571-3 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2018-11-14 16:34:41,537 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: append_to_listEXIT has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: create_listFINAL has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L585-1 has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2018-11-14 16:34:41,538 WARN L170 areAnnotationChecker]: L592-2 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: create_listEXIT has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L586-2 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L593 has no Hoare annotation [2018-11-14 16:34:41,539 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L597-3 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L593-2 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 16:34:41,540 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2018-11-14 16:34:41,541 WARN L170 areAnnotationChecker]: L598-2 has no Hoare annotation [2018-11-14 16:34:41,541 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:34:41,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:34:41 BoogieIcfgContainer [2018-11-14 16:34:41,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:34:41,555 INFO L168 Benchmark]: Toolchain (without parser) took 5103.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -525.7 MB). Peak memory consumption was 213.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:34:41,557 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:34:41,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:34:41,558 INFO L168 Benchmark]: Boogie Preprocessor took 231.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:34:41,560 INFO L168 Benchmark]: RCFGBuilder took 1084.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:34:41,561 INFO L168 Benchmark]: TraceAbstraction took 3164.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 194.7 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. [2018-11-14 16:34:41,568 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 617.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 231.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -819.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1084.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3164.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 194.7 MB). Peak memory consumption was 194.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 594]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((high == 0bv32 && 0bv32 == high) && low == 0bv32) && 0bv32 == low - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 45 locations, 2 error locations. SAFE Result, 3.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 109 SDtfs, 15 SDslu, 42 SDs, 0 SdLazy, 3 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 12 NumberOfFragments, 22 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 2132 SizeOfPredicates, 4 NumberOfNonLiveVariables, 201 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...