/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/list-properties/list_flag-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:02:56,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:02:56,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:02:56,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:02:56,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:02:56,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:02:56,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:02:56,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:02:56,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:02:56,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:02:56,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:02:56,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:02:56,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:02:56,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:02:56,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:02:56,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:02:56,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:02:56,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:02:56,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:02:56,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:02:56,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:02:56,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:02:56,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:02:56,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:02:56,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:02:56,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:02:56,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:02:56,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:02:56,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:02:56,478 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:02:56,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:02:56,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:02:56,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:02:56,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:02:56,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:02:56,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:02:56,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:02:56,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:02:56,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:02:56,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:02:56,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:02:56,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:02:56,502 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:02:56,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:02:56,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:02:56,504 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:02:56,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:02:56,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:02:56,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:02:56,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:02:56,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:02:56,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:02:56,507 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:02:56,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:02:56,507 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:02:56,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:02:56,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:02:56,508 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:02:56,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:02:56,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:02:56,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:02:56,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:02:56,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:02:56,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:02:56,510 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:02:56,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:02:56,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:02:56,815 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:02:56,817 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:02:56,817 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:02:56,818 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag-1.i [2020-07-11 01:02:56,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88801065e/28a9bfc7e8b74692a7fff694bf7eb116/FLAG0e86ceeef [2020-07-11 01:02:57,443 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:02:57,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_flag-1.i [2020-07-11 01:02:57,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88801065e/28a9bfc7e8b74692a7fff694bf7eb116/FLAG0e86ceeef [2020-07-11 01:02:57,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88801065e/28a9bfc7e8b74692a7fff694bf7eb116 [2020-07-11 01:02:57,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:02:57,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:02:57,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:02:57,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:02:57,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:02:57,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:02:57" (1/1) ... [2020-07-11 01:02:57,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2d08fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:57, skipping insertion in model container [2020-07-11 01:02:57,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:02:57" (1/1) ... [2020-07-11 01:02:57,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:02:57,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:02:58,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:02:58,311 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:02:58,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:02:58,456 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:02:58,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58 WrapperNode [2020-07-11 01:02:58,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:02:58,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:02:58,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:02:58,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:02:58,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (1/1) ... [2020-07-11 01:02:58,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:02:58,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:02:58,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:02:58,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:02:58,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (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 [2020-07-11 01:02:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:02:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:02:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-11 01:02:58,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-11 01:02:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-11 01:02:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-11 01:02:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-11 01:02:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-11 01:02:58,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:02:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:02:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:02:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:02:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:02:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:02:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:02:58,607 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:02:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:02:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:02:58,608 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:02:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:02:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:02:58,609 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:02:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:02:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:02:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:02:58,611 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-11 01:02:58,612 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:02:58,613 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:02:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:02:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:02:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:02:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:02:58,623 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:02:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:02:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:02:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:02:58,624 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:02:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:02:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:02:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:02:58,625 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:02:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:02:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:02:58,626 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:02:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:02:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:02:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:02:58,627 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:02:58,628 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:02:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:02:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:02:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:02:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-11 01:02:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-11 01:02:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:02:58,631 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:02:58,631 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:02:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:02:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:02:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:02:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:02:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:02:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:02:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:02:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:02:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:02:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:02:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:02:58,978 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-11 01:02:59,234 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:02:59,234 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-11 01:02:59,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:02:59 BoogieIcfgContainer [2020-07-11 01:02:59,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:02:59,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:02:59,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:02:59,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:02:59,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:02:57" (1/3) ... [2020-07-11 01:02:59,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68f2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:02:59, skipping insertion in model container [2020-07-11 01:02:59,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:58" (2/3) ... [2020-07-11 01:02:59,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68f2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:02:59, skipping insertion in model container [2020-07-11 01:02:59,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:02:59" (3/3) ... [2020-07-11 01:02:59,248 INFO L109 eAbstractionObserver]: Analyzing ICFG list_flag-1.i [2020-07-11 01:02:59,258 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:02:59,267 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:02:59,282 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:02:59,305 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:02:59,305 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:02:59,305 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:02:59,306 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:02:59,306 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:02:59,306 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:02:59,306 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:02:59,306 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:02:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2020-07-11 01:02:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 01:02:59,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:59,336 INFO L422 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, 1, 1, 1, 1] [2020-07-11 01:02:59,337 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1409516089, now seen corresponding path program 1 times [2020-07-11 01:02:59,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:59,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781583875] [2020-07-11 01:02:59,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:59,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {65#true} is VALID [2020-07-11 01:02:59,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-11 01:02:59,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-11 01:02:59,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-11 01:02:59,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {65#true} {65#true} #142#return; {65#true} is VALID [2020-07-11 01:02:59,624 INFO L263 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {72#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:59,625 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {65#true} is VALID [2020-07-11 01:02:59,625 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} #valid := #valid[0 := 0]; {65#true} is VALID [2020-07-11 01:02:59,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {65#true} assume 0 < #StackHeapBarrier; {65#true} is VALID [2020-07-11 01:02:59,626 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#true} assume true; {65#true} is VALID [2020-07-11 01:02:59,626 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {65#true} {65#true} #142#return; {65#true} is VALID [2020-07-11 01:02:59,626 INFO L263 TraceCheckUtils]: 6: Hoare triple {65#true} call #t~ret12 := main(); {65#true} is VALID [2020-07-11 01:02:59,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {65#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {65#true} is VALID [2020-07-11 01:02:59,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {65#true} ~flag~0 := #t~nondet2; {65#true} is VALID [2020-07-11 01:02:59,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {65#true} havoc #t~nondet2; {65#true} is VALID [2020-07-11 01:02:59,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {65#true} havoc ~p~0.base, ~p~0.offset; {65#true} is VALID [2020-07-11 01:02:59,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {65#true} havoc ~a~0.base, ~a~0.offset; {65#true} is VALID [2020-07-11 01:02:59,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {65#true} havoc ~t~0.base, ~t~0.offset; {65#true} is VALID [2020-07-11 01:02:59,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {65#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L523 {65#true} is VALID [2020-07-11 01:02:59,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {65#true} ~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {65#true} is VALID [2020-07-11 01:02:59,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {65#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {65#true} is VALID [2020-07-11 01:02:59,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {65#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {65#true} is VALID [2020-07-11 01:02:59,631 INFO L280 TraceCheckUtils]: 17: Hoare triple {65#true} assume !true; {66#false} is VALID [2020-07-11 01:02:59,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {66#false} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-6 {66#false} is VALID [2020-07-11 01:02:59,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {66#false} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {66#false} is VALID [2020-07-11 01:02:59,632 INFO L280 TraceCheckUtils]: 20: Hoare triple {66#false} assume 0 != ~flag~0; {66#false} is VALID [2020-07-11 01:02:59,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {66#false} assume !true; {66#false} is VALID [2020-07-11 01:02:59,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {66#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-6 {66#false} is VALID [2020-07-11 01:02:59,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {66#false} assume 3 != #t~mem11; {66#false} is VALID [2020-07-11 01:02:59,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {66#false} havoc #t~mem11; {66#false} is VALID [2020-07-11 01:02:59,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {66#false} assume !false; {66#false} is VALID [2020-07-11 01:02:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:02:59,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781583875] [2020-07-11 01:02:59,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:02:59,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571216007] [2020-07-11 01:02:59,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-11 01:02:59,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:59,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:02:59,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:59,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:02:59,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:02:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:02:59,716 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2020-07-11 01:03:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:00,045 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2020-07-11 01:03:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:03:00,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-11 01:03:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-11 01:03:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:03:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2020-07-11 01:03:00,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2020-07-11 01:03:00,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:00,236 INFO L225 Difference]: With dead ends: 89 [2020-07-11 01:03:00,236 INFO L226 Difference]: Without dead ends: 53 [2020-07-11 01:03:00,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:03:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-11 01:03:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-11 01:03:00,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:00,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-11 01:03:00,343 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-11 01:03:00,344 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-11 01:03:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:00,354 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-11 01:03:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-11 01:03:00,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:00,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:00,355 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-11 01:03:00,356 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-11 01:03:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:00,364 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2020-07-11 01:03:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-11 01:03:00,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:00,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:00,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:00,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-11 01:03:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-07-11 01:03:00,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 26 [2020-07-11 01:03:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:00,378 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-07-11 01:03:00,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:03:00,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 57 transitions. [2020-07-11 01:03:00,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-11 01:03:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 01:03:00,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:00,454 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:00,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:03:00,455 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:00,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1836407039, now seen corresponding path program 1 times [2020-07-11 01:03:00,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:00,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970771372] [2020-07-11 01:03:00,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:00,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {476#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {465#true} is VALID [2020-07-11 01:03:00,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {465#true} #valid := #valid[0 := 0]; {465#true} is VALID [2020-07-11 01:03:00,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {465#true} assume 0 < #StackHeapBarrier; {465#true} is VALID [2020-07-11 01:03:00,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {465#true} assume true; {465#true} is VALID [2020-07-11 01:03:00,704 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {465#true} {465#true} #142#return; {465#true} is VALID [2020-07-11 01:03:00,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {476#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:00,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {476#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {465#true} is VALID [2020-07-11 01:03:00,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {465#true} #valid := #valid[0 := 0]; {465#true} is VALID [2020-07-11 01:03:00,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {465#true} assume 0 < #StackHeapBarrier; {465#true} is VALID [2020-07-11 01:03:00,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {465#true} assume true; {465#true} is VALID [2020-07-11 01:03:00,707 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {465#true} {465#true} #142#return; {465#true} is VALID [2020-07-11 01:03:00,707 INFO L263 TraceCheckUtils]: 6: Hoare triple {465#true} call #t~ret12 := main(); {465#true} is VALID [2020-07-11 01:03:00,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {465#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {465#true} is VALID [2020-07-11 01:03:00,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#true} ~flag~0 := #t~nondet2; {465#true} is VALID [2020-07-11 01:03:00,708 INFO L280 TraceCheckUtils]: 9: Hoare triple {465#true} havoc #t~nondet2; {465#true} is VALID [2020-07-11 01:03:00,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {465#true} havoc ~p~0.base, ~p~0.offset; {465#true} is VALID [2020-07-11 01:03:00,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {465#true} havoc ~a~0.base, ~a~0.offset; {465#true} is VALID [2020-07-11 01:03:00,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {465#true} havoc ~t~0.base, ~t~0.offset; {465#true} is VALID [2020-07-11 01:03:00,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {465#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L523 {465#true} is VALID [2020-07-11 01:03:00,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {465#true} ~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {465#true} is VALID [2020-07-11 01:03:00,710 INFO L280 TraceCheckUtils]: 15: Hoare triple {465#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {465#true} is VALID [2020-07-11 01:03:00,712 INFO L280 TraceCheckUtils]: 16: Hoare triple {465#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:00,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:00,715 INFO L280 TraceCheckUtils]: 18: Hoare triple {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4); {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:00,716 INFO L280 TraceCheckUtils]: 19: Hoare triple {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet4; {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:00,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {472#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-6 {473#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-11 01:03:00,718 INFO L280 TraceCheckUtils]: 21: Hoare triple {473#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:00,719 INFO L280 TraceCheckUtils]: 22: Hoare triple {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:00,720 INFO L280 TraceCheckUtils]: 23: Hoare triple {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L540-5 {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:00,721 INFO L280 TraceCheckUtils]: 24: Hoare triple {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2 == #t~mem7); {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:00,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} havoc #t~mem7; {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:00,722 INFO L280 TraceCheckUtils]: 26: Hoare triple {474#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-6 {475#(= |main_#t~mem11| 3)} is VALID [2020-07-11 01:03:00,723 INFO L280 TraceCheckUtils]: 27: Hoare triple {475#(= |main_#t~mem11| 3)} assume 3 != #t~mem11; {466#false} is VALID [2020-07-11 01:03:00,724 INFO L280 TraceCheckUtils]: 28: Hoare triple {466#false} havoc #t~mem11; {466#false} is VALID [2020-07-11 01:03:00,724 INFO L280 TraceCheckUtils]: 29: Hoare triple {466#false} assume !false; {466#false} is VALID [2020-07-11 01:03:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:00,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970771372] [2020-07-11 01:03:00,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:00,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:03:00,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841721769] [2020-07-11 01:03:00,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-11 01:03:00,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:00,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:03:00,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:00,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:03:00,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:03:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:03:00,787 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2020-07-11 01:03:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:01,588 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2020-07-11 01:03:01,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:03:01,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-11 01:03:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2020-07-11 01:03:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2020-07-11 01:03:01,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 132 transitions. [2020-07-11 01:03:01,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:01,776 INFO L225 Difference]: With dead ends: 122 [2020-07-11 01:03:01,777 INFO L226 Difference]: Without dead ends: 115 [2020-07-11 01:03:01,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:03:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-11 01:03:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 63. [2020-07-11 01:03:01,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:01,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 63 states. [2020-07-11 01:03:01,848 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 63 states. [2020-07-11 01:03:01,848 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 63 states. [2020-07-11 01:03:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:01,854 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-11 01:03:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2020-07-11 01:03:01,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:01,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:01,856 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 115 states. [2020-07-11 01:03:01,856 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 115 states. [2020-07-11 01:03:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:01,863 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-11 01:03:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2020-07-11 01:03:01,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:01,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:01,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:01,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-07-11 01:03:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2020-07-11 01:03:01,867 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 30 [2020-07-11 01:03:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:01,868 INFO L479 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2020-07-11 01:03:01,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:03:01,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 63 states and 69 transitions. [2020-07-11 01:03:01,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2020-07-11 01:03:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 01:03:01,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:01,939 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:01,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:03:01,940 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1477911671, now seen corresponding path program 1 times [2020-07-11 01:03:01,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:01,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395247581] [2020-07-11 01:03:01,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:02,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {1094#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1083#true} is VALID [2020-07-11 01:03:02,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {1083#true} #valid := #valid[0 := 0]; {1083#true} is VALID [2020-07-11 01:03:02,069 INFO L280 TraceCheckUtils]: 2: Hoare triple {1083#true} assume 0 < #StackHeapBarrier; {1083#true} is VALID [2020-07-11 01:03:02,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {1083#true} assume true; {1083#true} is VALID [2020-07-11 01:03:02,070 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1083#true} {1083#true} #142#return; {1083#true} is VALID [2020-07-11 01:03:02,071 INFO L263 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1094#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:02,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {1094#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1083#true} is VALID [2020-07-11 01:03:02,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {1083#true} #valid := #valid[0 := 0]; {1083#true} is VALID [2020-07-11 01:03:02,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {1083#true} assume 0 < #StackHeapBarrier; {1083#true} is VALID [2020-07-11 01:03:02,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {1083#true} assume true; {1083#true} is VALID [2020-07-11 01:03:02,072 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1083#true} {1083#true} #142#return; {1083#true} is VALID [2020-07-11 01:03:02,073 INFO L263 TraceCheckUtils]: 6: Hoare triple {1083#true} call #t~ret12 := main(); {1083#true} is VALID [2020-07-11 01:03:02,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {1083#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1083#true} is VALID [2020-07-11 01:03:02,073 INFO L280 TraceCheckUtils]: 8: Hoare triple {1083#true} ~flag~0 := #t~nondet2; {1083#true} is VALID [2020-07-11 01:03:02,073 INFO L280 TraceCheckUtils]: 9: Hoare triple {1083#true} havoc #t~nondet2; {1083#true} is VALID [2020-07-11 01:03:02,074 INFO L280 TraceCheckUtils]: 10: Hoare triple {1083#true} havoc ~p~0.base, ~p~0.offset; {1083#true} is VALID [2020-07-11 01:03:02,074 INFO L280 TraceCheckUtils]: 11: Hoare triple {1083#true} havoc ~a~0.base, ~a~0.offset; {1083#true} is VALID [2020-07-11 01:03:02,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {1083#true} havoc ~t~0.base, ~t~0.offset; {1083#true} is VALID [2020-07-11 01:03:02,074 INFO L280 TraceCheckUtils]: 13: Hoare triple {1083#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L523 {1083#true} is VALID [2020-07-11 01:03:02,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {1083#true} ~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {1083#true} is VALID [2020-07-11 01:03:02,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1083#true} is VALID [2020-07-11 01:03:02,076 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:02,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:02,078 INFO L280 TraceCheckUtils]: 18: Hoare triple {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4); {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:02,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet4; {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:02,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {1090#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-6 {1091#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-11 01:03:02,080 INFO L280 TraceCheckUtils]: 21: Hoare triple {1091#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1092#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:02,081 INFO L280 TraceCheckUtils]: 22: Hoare triple {1092#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume 0 != ~flag~0; {1092#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:02,082 INFO L280 TraceCheckUtils]: 23: Hoare triple {1092#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L540-5 {1093#(= 3 |main_#t~mem7|)} is VALID [2020-07-11 01:03:02,082 INFO L280 TraceCheckUtils]: 24: Hoare triple {1093#(= 3 |main_#t~mem7|)} assume !!(2 == #t~mem7); {1084#false} is VALID [2020-07-11 01:03:02,083 INFO L280 TraceCheckUtils]: 25: Hoare triple {1084#false} havoc #t~mem7; {1084#false} is VALID [2020-07-11 01:03:02,083 INFO L280 TraceCheckUtils]: 26: Hoare triple {1084#false} SUMMARY for call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L541 {1084#false} is VALID [2020-07-11 01:03:02,083 INFO L280 TraceCheckUtils]: 27: Hoare triple {1084#false} ~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset; {1084#false} is VALID [2020-07-11 01:03:02,084 INFO L280 TraceCheckUtils]: 28: Hoare triple {1084#false} havoc #t~mem8.base, #t~mem8.offset; {1084#false} is VALID [2020-07-11 01:03:02,084 INFO L280 TraceCheckUtils]: 29: Hoare triple {1084#false} SUMMARY for call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L540-5 {1084#false} is VALID [2020-07-11 01:03:02,084 INFO L280 TraceCheckUtils]: 30: Hoare triple {1084#false} assume !(2 == #t~mem7); {1084#false} is VALID [2020-07-11 01:03:02,084 INFO L280 TraceCheckUtils]: 31: Hoare triple {1084#false} havoc #t~mem7; {1084#false} is VALID [2020-07-11 01:03:02,085 INFO L280 TraceCheckUtils]: 32: Hoare triple {1084#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-6 {1084#false} is VALID [2020-07-11 01:03:02,085 INFO L280 TraceCheckUtils]: 33: Hoare triple {1084#false} assume 3 != #t~mem11; {1084#false} is VALID [2020-07-11 01:03:02,085 INFO L280 TraceCheckUtils]: 34: Hoare triple {1084#false} havoc #t~mem11; {1084#false} is VALID [2020-07-11 01:03:02,086 INFO L280 TraceCheckUtils]: 35: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2020-07-11 01:03:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:02,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395247581] [2020-07-11 01:03:02,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:02,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:03:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944732225] [2020-07-11 01:03:02,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 01:03:02,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:02,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:03:02,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:02,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:03:02,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:03:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:03:02,127 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 7 states. [2020-07-11 01:03:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:02,857 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2020-07-11 01:03:02,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:03:02,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 01:03:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2020-07-11 01:03:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2020-07-11 01:03:02,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 125 transitions. [2020-07-11 01:03:03,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:03,006 INFO L225 Difference]: With dead ends: 117 [2020-07-11 01:03:03,006 INFO L226 Difference]: Without dead ends: 103 [2020-07-11 01:03:03,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:03:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-11 01:03:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-11 01:03:03,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:03,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 61 states. [2020-07-11 01:03:03,063 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 61 states. [2020-07-11 01:03:03,064 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 61 states. [2020-07-11 01:03:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:03,068 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2020-07-11 01:03:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2020-07-11 01:03:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:03,069 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 103 states. [2020-07-11 01:03:03,069 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 103 states. [2020-07-11 01:03:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:03,074 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2020-07-11 01:03:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2020-07-11 01:03:03,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:03,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:03,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:03,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-11 01:03:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2020-07-11 01:03:03,078 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 36 [2020-07-11 01:03:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:03,078 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2020-07-11 01:03:03,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:03:03,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2020-07-11 01:03:03,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-07-11 01:03:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 01:03:03,139 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:03,140 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:03,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:03:03,140 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:03,140 INFO L82 PathProgramCache]: Analyzing trace with hash -380981001, now seen corresponding path program 1 times [2020-07-11 01:03:03,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:03,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78566590] [2020-07-11 01:03:03,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:03:03,240 INFO L280 TraceCheckUtils]: 0: Hoare triple {1674#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1663#true} is VALID [2020-07-11 01:03:03,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {1663#true} #valid := #valid[0 := 0]; {1663#true} is VALID [2020-07-11 01:03:03,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {1663#true} assume 0 < #StackHeapBarrier; {1663#true} is VALID [2020-07-11 01:03:03,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {1663#true} assume true; {1663#true} is VALID [2020-07-11 01:03:03,242 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1663#true} {1663#true} #142#return; {1663#true} is VALID [2020-07-11 01:03:03,247 INFO L263 TraceCheckUtils]: 0: Hoare triple {1663#true} call ULTIMATE.init(); {1674#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:03:03,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {1674#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1663#true} is VALID [2020-07-11 01:03:03,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {1663#true} #valid := #valid[0 := 0]; {1663#true} is VALID [2020-07-11 01:03:03,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {1663#true} assume 0 < #StackHeapBarrier; {1663#true} is VALID [2020-07-11 01:03:03,249 INFO L280 TraceCheckUtils]: 4: Hoare triple {1663#true} assume true; {1663#true} is VALID [2020-07-11 01:03:03,249 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1663#true} {1663#true} #142#return; {1663#true} is VALID [2020-07-11 01:03:03,249 INFO L263 TraceCheckUtils]: 6: Hoare triple {1663#true} call #t~ret12 := main(); {1663#true} is VALID [2020-07-11 01:03:03,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {1663#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1663#true} is VALID [2020-07-11 01:03:03,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {1663#true} ~flag~0 := #t~nondet2; {1663#true} is VALID [2020-07-11 01:03:03,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {1663#true} havoc #t~nondet2; {1663#true} is VALID [2020-07-11 01:03:03,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {1663#true} havoc ~p~0.base, ~p~0.offset; {1663#true} is VALID [2020-07-11 01:03:03,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {1663#true} havoc ~a~0.base, ~a~0.offset; {1663#true} is VALID [2020-07-11 01:03:03,252 INFO L280 TraceCheckUtils]: 12: Hoare triple {1663#true} havoc ~t~0.base, ~t~0.offset; {1663#true} is VALID [2020-07-11 01:03:03,252 INFO L280 TraceCheckUtils]: 13: Hoare triple {1663#true} SUMMARY for call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8); srcloc: L523 {1663#true} is VALID [2020-07-11 01:03:03,252 INFO L280 TraceCheckUtils]: 14: Hoare triple {1663#true} ~a~0.base, ~a~0.offset := #t~malloc3.base, #t~malloc3.offset; {1663#true} is VALID [2020-07-11 01:03:03,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {1663#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1663#true} is VALID [2020-07-11 01:03:03,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {1663#true} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:03,254 INFO L280 TraceCheckUtils]: 17: Hoare triple {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:03,255 INFO L280 TraceCheckUtils]: 18: Hoare triple {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet4); {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:03,256 INFO L280 TraceCheckUtils]: 19: Hoare triple {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} havoc #t~nondet4; {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-11 01:03:03,257 INFO L280 TraceCheckUtils]: 20: Hoare triple {1670#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} SUMMARY for call write~int(3, ~p~0.base, ~p~0.offset, 4); srcloc: L526-6 {1671#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-11 01:03:03,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {1671#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1672#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:03,258 INFO L280 TraceCheckUtils]: 22: Hoare triple {1672#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(0 != ~flag~0); {1672#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-11 01:03:03,259 INFO L280 TraceCheckUtils]: 23: Hoare triple {1672#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {1673#(= 3 |main_#t~mem9|)} is VALID [2020-07-11 01:03:03,259 INFO L280 TraceCheckUtils]: 24: Hoare triple {1673#(= 3 |main_#t~mem9|)} assume !!(1 == #t~mem9); {1664#false} is VALID [2020-07-11 01:03:03,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {1664#false} havoc #t~mem9; {1664#false} is VALID [2020-07-11 01:03:03,260 INFO L280 TraceCheckUtils]: 26: Hoare triple {1664#false} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4); srcloc: L544 {1664#false} is VALID [2020-07-11 01:03:03,260 INFO L280 TraceCheckUtils]: 27: Hoare triple {1664#false} ~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset; {1664#false} is VALID [2020-07-11 01:03:03,261 INFO L280 TraceCheckUtils]: 28: Hoare triple {1664#false} havoc #t~mem10.base, #t~mem10.offset; {1664#false} is VALID [2020-07-11 01:03:03,261 INFO L280 TraceCheckUtils]: 29: Hoare triple {1664#false} SUMMARY for call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-5 {1664#false} is VALID [2020-07-11 01:03:03,261 INFO L280 TraceCheckUtils]: 30: Hoare triple {1664#false} assume !(1 == #t~mem9); {1664#false} is VALID [2020-07-11 01:03:03,261 INFO L280 TraceCheckUtils]: 31: Hoare triple {1664#false} havoc #t~mem9; {1664#false} is VALID [2020-07-11 01:03:03,262 INFO L280 TraceCheckUtils]: 32: Hoare triple {1664#false} SUMMARY for call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); srcloc: L543-6 {1664#false} is VALID [2020-07-11 01:03:03,262 INFO L280 TraceCheckUtils]: 33: Hoare triple {1664#false} assume 3 != #t~mem11; {1664#false} is VALID [2020-07-11 01:03:03,262 INFO L280 TraceCheckUtils]: 34: Hoare triple {1664#false} havoc #t~mem11; {1664#false} is VALID [2020-07-11 01:03:03,262 INFO L280 TraceCheckUtils]: 35: Hoare triple {1664#false} assume !false; {1664#false} is VALID [2020-07-11 01:03:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:03:03,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78566590] [2020-07-11 01:03:03,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:03:03,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 01:03:03,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135772022] [2020-07-11 01:03:03,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 01:03:03,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:03:03,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 01:03:03,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:03,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 01:03:03,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:03:03,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 01:03:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 01:03:03,298 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 7 states. [2020-07-11 01:03:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:03,899 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2020-07-11 01:03:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:03:03,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-11 01:03:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:03:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2020-07-11 01:03:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 01:03:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2020-07-11 01:03:03,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2020-07-11 01:03:04,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:04,004 INFO L225 Difference]: With dead ends: 100 [2020-07-11 01:03:04,004 INFO L226 Difference]: Without dead ends: 82 [2020-07-11 01:03:04,005 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-11 01:03:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-11 01:03:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2020-07-11 01:03:04,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:03:04,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 55 states. [2020-07-11 01:03:04,043 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 55 states. [2020-07-11 01:03:04,043 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 55 states. [2020-07-11 01:03:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:04,046 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2020-07-11 01:03:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-07-11 01:03:04,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:04,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:04,048 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 82 states. [2020-07-11 01:03:04,048 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 82 states. [2020-07-11 01:03:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:03:04,052 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2020-07-11 01:03:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2020-07-11 01:03:04,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:03:04,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:03:04,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:03:04,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:03:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-11 01:03:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-11 01:03:04,056 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 36 [2020-07-11 01:03:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:03:04,056 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-11 01:03:04,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 01:03:04,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2020-07-11 01:03:04,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:03:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-11 01:03:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 01:03:04,121 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:03:04,121 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:03:04,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:03:04,122 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:03:04,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:03:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1659276919, now seen corresponding path program 1 times [2020-07-11 01:03:04,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:03:04,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031731357] [2020-07-11 01:03:04,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:03:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:03:04,201 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:03:04,202 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:03:04,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:03:04,295 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-11 01:03:04,296 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:03:04,297 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L179 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L164-1 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: L169-1 has no Hoare annotation [2020-07-11 01:03:04,298 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: L521-1 has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:03:04,299 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L522-2 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L523 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L524 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L524-1 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L524-1 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L524-3 has no Hoare annotation [2020-07-11 01:03:04,300 WARN L170 areAnnotationChecker]: L526-5 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-5 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-6 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L537 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-2 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-11 01:03:04,301 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L540-5 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L540-5 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L543-5 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L543-5 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L530 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L543-6 has no Hoare annotation [2020-07-11 01:03:04,302 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L540-1 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L543-1 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L530-1 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L545 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L540-2 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L540-4 has no Hoare annotation [2020-07-11 01:03:04,303 WARN L170 areAnnotationChecker]: L543-2 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L543-4 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L532 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L545-1 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L545-3 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-11 01:03:04,304 WARN L170 areAnnotationChecker]: L533 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L546 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L545-4 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L544-1 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L533-1 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L533-1 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: L533-3 has no Hoare annotation [2020-07-11 01:03:04,305 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:03:04,306 WARN L170 areAnnotationChecker]: L541-2 has no Hoare annotation [2020-07-11 01:03:04,306 WARN L170 areAnnotationChecker]: L544-2 has no Hoare annotation [2020-07-11 01:03:04,306 WARN L170 areAnnotationChecker]: L534 has no Hoare annotation [2020-07-11 01:03:04,306 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2020-07-11 01:03:04,306 WARN L170 areAnnotationChecker]: L535-1 has no Hoare annotation [2020-07-11 01:03:04,306 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:03:04,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:03:04 BoogieIcfgContainer [2020-07-11 01:03:04,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:03:04,313 INFO L168 Benchmark]: Toolchain (without parser) took 6532.14 ms. Allocated memory was 138.4 MB in the beginning and 283.1 MB in the end (delta: 144.7 MB). Free memory was 102.7 MB in the beginning and 114.5 MB in the end (delta: -11.8 MB). Peak memory consumption was 132.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,314 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.22 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 168.8 MB in the end (delta: -66.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,316 INFO L168 Benchmark]: Boogie Preprocessor took 85.39 ms. Allocated memory is still 203.4 MB. Free memory was 168.8 MB in the beginning and 165.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,316 INFO L168 Benchmark]: RCFGBuilder took 696.00 ms. Allocated memory is still 203.4 MB. Free memory was 165.0 MB in the beginning and 107.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,317 INFO L168 Benchmark]: TraceAbstraction took 5069.69 ms. Allocated memory was 203.4 MB in the beginning and 283.1 MB in the end (delta: 79.7 MB). Free memory was 106.4 MB in the beginning and 114.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:03:04,321 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.22 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 168.8 MB in the end (delta: -66.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.39 ms. Allocated memory is still 203.4 MB. Free memory was 168.8 MB in the beginning and 165.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 696.00 ms. Allocated memory is still 203.4 MB. Free memory was 165.0 MB in the beginning and 107.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5069.69 ms. Allocated memory was 203.4 MB in the beginning and 283.1 MB in the end (delta: 79.7 MB). Free memory was 106.4 MB in the beginning and 114.5 MB in the end (delta: -8.1 MB). Peak memory consumption was 71.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] int flag = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, flag=1] [L522] List p, a, t; VAL [flag=1] [L523] a = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L525] p = a VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L527] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L528] p->h = 1 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L532] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L533] COND FALSE !(t == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L534] p->n = t VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L535] EXPR p->n VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->n={-2:0}, t={-2:0}] [L535] p = p->n VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, p->n={-2:0}, t={-2:0}] [L526] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L537] p->h = 3 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-2:0}, t={-2:0}] [L538] p = a VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L539] COND TRUE \read(flag) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] [L540] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L540] COND FALSE !(p->h == 2) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L545] EXPR p->h VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L545] COND TRUE p->h != 3 VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, p->h=1, t={-2:0}] [L546] __VERIFIER_error() VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 217 SDslu, 451 SDs, 0 SdLazy, 504 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 9910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...