/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:31:55,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:31:55,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:31:55,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:31:55,182 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:31:55,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:31:55,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:31:55,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:31:55,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:31:55,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:31:55,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:31:55,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:31:55,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:31:55,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:31:55,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:31:55,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:31:55,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:31:55,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:31:55,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:31:55,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:31:55,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:31:55,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:31:55,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:31:55,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:31:55,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:31:55,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:31:55,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:31:55,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:31:55,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:31:55,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:31:55,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:31:55,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:31:55,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:31:55,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:31:55,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:31:55,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:31:55,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:31:55,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:31:55,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:31:55,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:31:55,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:31:55,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:31:55,244 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:31:55,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:31:55,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:31:55,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:31:55,247 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:31:55,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:31:55,248 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:31:55,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:31:55,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:31:55,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:31:55,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:31:55,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:31:55,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:31:55,249 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:31:55,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:31:55,250 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:31:55,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:31:55,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:31:55,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:31:55,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:31:55,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:31:55,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:31:55,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:31:55,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:31:55,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:31:55,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:31:55,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:31:55,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:31:55,254 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:31:55,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:31:55,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:31:55,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:31:55,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:31:55,600 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:31:55,600 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:31:55,601 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-17 22:31:55,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032c9f0f9/fcc47cc0238c457b8bdcc4b8b3cdcda7/FLAGb364c6312 [2020-07-17 22:31:56,260 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:31:56,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-17 22:31:56,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032c9f0f9/fcc47cc0238c457b8bdcc4b8b3cdcda7/FLAGb364c6312 [2020-07-17 22:31:56,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032c9f0f9/fcc47cc0238c457b8bdcc4b8b3cdcda7 [2020-07-17 22:31:56,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:31:56,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:31:56,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:31:56,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:31:56,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:31:56,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:31:56" (1/1) ... [2020-07-17 22:31:56,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cd1c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:56, skipping insertion in model container [2020-07-17 22:31:56,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:31:56" (1/1) ... [2020-07-17 22:31:56,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:31:56,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:31:57,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:31:57,134 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:31:57,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:31:57,256 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:31:57,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57 WrapperNode [2020-07-17 22:31:57,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:31:57,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:31:57,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:31:57,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:31:57,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (1/1) ... [2020-07-17 22:31:57,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:31:57,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:31:57,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:31:57,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:31:57,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (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-17 22:31:57,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:31:57,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:31:57,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:31:57,408 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:31:57,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:31:57,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:31:57,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:31:57,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:31:57,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:31:57,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:31:57,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:31:57,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:31:57,411 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:31:57,411 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:31:57,411 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:31:57,412 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:31:57,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:31:57,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:31:57,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:31:57,413 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:31:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:31:57,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:31:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:31:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:31:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:31:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:31:57,419 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:31:57,419 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:31:57,419 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:31:57,420 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:31:57,421 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:31:57,422 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:31:57,423 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:31:57,424 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:31:57,425 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:31:57,426 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:31:57,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:31:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:31:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:31:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:31:57,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:31:58,161 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:31:58,161 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-17 22:31:58,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:31:58 BoogieIcfgContainer [2020-07-17 22:31:58,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:31:58,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:31:58,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:31:58,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:31:58,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:31:56" (1/3) ... [2020-07-17 22:31:58,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aa3ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:31:58, skipping insertion in model container [2020-07-17 22:31:58,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:31:57" (2/3) ... [2020-07-17 22:31:58,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aa3ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:31:58, skipping insertion in model container [2020-07-17 22:31:58,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:31:58" (3/3) ... [2020-07-17 22:31:58,174 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-17 22:31:58,184 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:31:58,193 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-17 22:31:58,204 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-17 22:31:58,222 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:31:58,223 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:31:58,223 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:31:58,223 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:31:58,223 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:31:58,223 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:31:58,224 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:31:58,224 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:31:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-07-17 22:31:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:31:58,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:58,252 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:58,253 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:31:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash 68430596, now seen corresponding path program 1 times [2020-07-17 22:31:58,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:58,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656494407] [2020-07-17 22:31:58,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:58,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {52#true} is VALID [2020-07-17 22:31:58,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-17 22:31:58,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {52#true} {52#true} #161#return; {52#true} is VALID [2020-07-17 22:31:58,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:58,522 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {52#true} is VALID [2020-07-17 22:31:58,522 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2020-07-17 22:31:58,522 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #161#return; {52#true} is VALID [2020-07-17 22:31:58,523 INFO L263 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret18 := main(); {52#true} is VALID [2020-07-17 22:31:58,523 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {52#true} is VALID [2020-07-17 22:31:58,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2020-07-17 22:31:58,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {53#false} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {53#false} is VALID [2020-07-17 22:31:58,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {53#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {53#false} is VALID [2020-07-17 22:31:58,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {53#false} assume !false; {53#false} is VALID [2020-07-17 22:31:58,526 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-17 22:31:58,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656494407] [2020-07-17 22:31:58,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:58,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:31:58,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434754999] [2020-07-17 22:31:58,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:31:58,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:58,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:31:58,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:58,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:31:58,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:31:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:31:58,579 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2020-07-17 22:31:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:58,856 INFO L93 Difference]: Finished difference Result 92 states and 138 transitions. [2020-07-17 22:31:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:31:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-17 22:31:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:31:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:31:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:31:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-17 22:31:58,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-17 22:31:59,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:59,096 INFO L225 Difference]: With dead ends: 92 [2020-07-17 22:31:59,096 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 22:31:59,104 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-17 22:31:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 22:31:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-17 22:31:59,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:59,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2020-07-17 22:31:59,158 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-17 22:31:59,158 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-17 22:31:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:59,166 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-17 22:31:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-17 22:31:59,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:59,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:59,168 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2020-07-17 22:31:59,168 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2020-07-17 22:31:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:59,177 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-17 22:31:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-17 22:31:59,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:59,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:59,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:59,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:31:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-07-17 22:31:59,186 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 10 [2020-07-17 22:31:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:59,187 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-07-17 22:31:59,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:31:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-17 22:31:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:31:59,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:59,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:59,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:31:59,189 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:31:59,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 67663975, now seen corresponding path program 1 times [2020-07-17 22:31:59,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:59,190 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634538503] [2020-07-17 22:31:59,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:31:59,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {307#true} is VALID [2020-07-17 22:31:59,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-17 22:31:59,389 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {307#true} {307#true} #161#return; {307#true} is VALID [2020-07-17 22:31:59,391 INFO L263 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:31:59,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {314#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {307#true} is VALID [2020-07-17 22:31:59,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#true} assume true; {307#true} is VALID [2020-07-17 22:31:59,392 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {307#true} {307#true} #161#return; {307#true} is VALID [2020-07-17 22:31:59,392 INFO L263 TraceCheckUtils]: 4: Hoare triple {307#true} call #t~ret18 := main(); {307#true} is VALID [2020-07-17 22:31:59,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {307#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {312#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-17 22:31:59,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {312#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-17 22:31:59,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {312#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4);havoc #t~mem3.base, #t~mem3.offset;call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset;havoc #t~mem4.base, #t~mem4.offset;call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); {313#(not (= 0 main_~x~0.base))} is VALID [2020-07-17 22:31:59,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {308#false} is VALID [2020-07-17 22:31:59,402 INFO L280 TraceCheckUtils]: 9: Hoare triple {308#false} assume !false; {308#false} is VALID [2020-07-17 22:31:59,403 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-17 22:31:59,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634538503] [2020-07-17 22:31:59,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:31:59,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:31:59,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157073621] [2020-07-17 22:31:59,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:31:59,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:31:59,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:31:59,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:59,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:31:59,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:31:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:31:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:31:59,429 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2020-07-17 22:31:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:59,812 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-17 22:31:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:31:59,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:31:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:31:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-17 22:31:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:31:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-07-17 22:31:59,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2020-07-17 22:31:59,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:31:59,901 INFO L225 Difference]: With dead ends: 43 [2020-07-17 22:31:59,901 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:31:59,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:31:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:31:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-17 22:31:59,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:31:59,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-17 22:31:59,916 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-17 22:31:59,916 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-17 22:31:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:59,919 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:31:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:31:59,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:59,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:59,920 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-17 22:31:59,921 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-17 22:31:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:31:59,924 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-17 22:31:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:31:59,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:31:59,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:31:59,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:31:59,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:31:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:31:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-17 22:31:59,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 10 [2020-07-17 22:31:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:31:59,928 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-17 22:31:59,928 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:31:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-17 22:31:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:31:59,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:31:59,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:31:59,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:31:59,930 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:31:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:31:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 2097539711, now seen corresponding path program 1 times [2020-07-17 22:31:59,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:31:59,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450241596] [2020-07-17 22:31:59,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:31:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:00,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-17 22:32:00,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:32:00,046 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {505#true} {505#true} #161#return; {505#true} is VALID [2020-07-17 22:32:00,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:00,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {505#true} is VALID [2020-07-17 22:32:00,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:32:00,049 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #161#return; {505#true} is VALID [2020-07-17 22:32:00,049 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret18 := main(); {505#true} is VALID [2020-07-17 22:32:00,052 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-17 22:32:00,053 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-17 22:32:00,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1);havoc #t~nondet1; {510#(not (= 0 main_~head~0.base))} is VALID [2020-07-17 22:32:00,056 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(not (= 0 main_~head~0.base))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {511#(not (= 0 main_~x~0.base))} is VALID [2020-07-17 22:32:00,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {511#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {506#false} is VALID [2020-07-17 22:32:00,057 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:32:00,057 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-17 22:32:00,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450241596] [2020-07-17 22:32:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:00,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:32:00,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411473866] [2020-07-17 22:32:00,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-17 22:32:00,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:00,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:32:00,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:00,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:32:00,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:32:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:32:00,087 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2020-07-17 22:32:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:00,429 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-17 22:32:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:32:00,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-17 22:32:00,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:32:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-17 22:32:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:32:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-17 22:32:00,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2020-07-17 22:32:00,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:00,526 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:32:00,526 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:32:00,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:32:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:32:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2020-07-17 22:32:00,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:00,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 39 states. [2020-07-17 22:32:00,545 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 39 states. [2020-07-17 22:32:00,545 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 39 states. [2020-07-17 22:32:00,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:00,549 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-17 22:32:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-17 22:32:00,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:00,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:00,551 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 65 states. [2020-07-17 22:32:00,551 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 65 states. [2020-07-17 22:32:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:00,555 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-17 22:32:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-17 22:32:00,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:00,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:00,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:00,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:32:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-17 22:32:00,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2020-07-17 22:32:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:00,559 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-17 22:32:00,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:32:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-17 22:32:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:32:00,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:00,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:00,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:32:00,561 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -409997773, now seen corresponding path program 1 times [2020-07-17 22:32:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:00,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270644269] [2020-07-17 22:32:00,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:00,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-17 22:32:00,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-17 22:32:00,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #161#return; {776#true} is VALID [2020-07-17 22:32:00,691 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:00,691 INFO L280 TraceCheckUtils]: 1: Hoare triple {784#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {776#true} is VALID [2020-07-17 22:32:00,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-17 22:32:00,691 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #161#return; {776#true} is VALID [2020-07-17 22:32:00,692 INFO L263 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret18 := main(); {776#true} is VALID [2020-07-17 22:32:00,692 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {776#true} is VALID [2020-07-17 22:32:00,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {776#true} is VALID [2020-07-17 22:32:00,695 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} assume !(0 != #t~nondet1);havoc #t~nondet1; {776#true} is VALID [2020-07-17 22:32:00,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {776#true} is VALID [2020-07-17 22:32:00,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {776#true} is VALID [2020-07-17 22:32:00,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {776#true} goto; {776#true} is VALID [2020-07-17 22:32:00,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {776#true} call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {781#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-17 22:32:00,698 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8);havoc #t~mem8; {782#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-17 22:32:00,699 INFO L280 TraceCheckUtils]: 13: Hoare triple {782#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {783#(= |main_#t~mem11| 1)} is VALID [2020-07-17 22:32:00,700 INFO L280 TraceCheckUtils]: 14: Hoare triple {783#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11);havoc #t~mem11; {777#false} is VALID [2020-07-17 22:32:00,700 INFO L280 TraceCheckUtils]: 15: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-17 22:32:00,701 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-17 22:32:00,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270644269] [2020-07-17 22:32:00,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:00,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:32:00,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308412011] [2020-07-17 22:32:00,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:32:00,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:00,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:32:00,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:00,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:32:00,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:32:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:32:00,725 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 6 states. [2020-07-17 22:32:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:01,117 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-17 22:32:01,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:32:01,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:32:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-17 22:32:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-17 22:32:01,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-17 22:32:01,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:01,164 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:32:01,165 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:32:01,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:32:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:32:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-17 22:32:01,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:01,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2020-07-17 22:32:01,184 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:32:01,184 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:32:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:01,189 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:32:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:32:01,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:01,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:01,190 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2020-07-17 22:32:01,191 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2020-07-17 22:32:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:01,195 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:32:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:32:01,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:01,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:01,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:01,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-17 22:32:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2020-07-17 22:32:01,199 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 16 [2020-07-17 22:32:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:01,199 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2020-07-17 22:32:01,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:32:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:32:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:32:01,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:01,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:32:01,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:32:01,200 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash -409960037, now seen corresponding path program 1 times [2020-07-17 22:32:01,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:01,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652218091] [2020-07-17 22:32:01,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:32:01,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {959#true} is VALID [2020-07-17 22:32:01,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:32:01,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {959#true} {959#true} #161#return; {959#true} is VALID [2020-07-17 22:32:01,407 INFO L263 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:32:01,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {967#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {959#true} is VALID [2020-07-17 22:32:01,408 INFO L280 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2020-07-17 22:32:01,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #161#return; {959#true} is VALID [2020-07-17 22:32:01,409 INFO L263 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret18 := main(); {959#true} is VALID [2020-07-17 22:32:01,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {959#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4);call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4);call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-17 22:32:01,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-17 22:32:01,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1);havoc #t~nondet1; {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-17 22:32:01,415 INFO L280 TraceCheckUtils]: 8: Hoare triple {964#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4);havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4);call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4);havoc #t~mem7.base, #t~mem7.offset;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-17 22:32:01,417 INFO L280 TraceCheckUtils]: 9: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-17 22:32:01,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} goto; {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} is VALID [2020-07-17 22:32:01,420 INFO L280 TraceCheckUtils]: 11: Hoare triple {965#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~x~0.offset 0))} call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {966#(= 1 |main_#t~mem8|)} is VALID [2020-07-17 22:32:01,420 INFO L280 TraceCheckUtils]: 12: Hoare triple {966#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8);havoc #t~mem8; {960#false} is VALID [2020-07-17 22:32:01,421 INFO L280 TraceCheckUtils]: 13: Hoare triple {960#false} call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); {960#false} is VALID [2020-07-17 22:32:01,421 INFO L280 TraceCheckUtils]: 14: Hoare triple {960#false} assume !(0 == #t~mem9);havoc #t~mem9; {960#false} is VALID [2020-07-17 22:32:01,421 INFO L280 TraceCheckUtils]: 15: Hoare triple {960#false} assume !false; {960#false} is VALID [2020-07-17 22:32:01,422 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-17 22:32:01,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652218091] [2020-07-17 22:32:01,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:32:01,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:32:01,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737146191] [2020-07-17 22:32:01,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:32:01,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:32:01,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:32:01,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:01,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:32:01,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:32:01,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:32:01,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:32:01,444 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2020-07-17 22:32:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:01,948 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-17 22:32:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:32:01,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-17 22:32:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:32:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-17 22:32:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:32:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-17 22:32:01,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-17 22:32:02,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:32:02,058 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:32:02,058 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:32:02,059 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:32:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:32:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-17 22:32:02,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:32:02,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-17 22:32:02,081 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-17 22:32:02,081 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-17 22:32:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:02,083 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-17 22:32:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-17 22:32:02,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:02,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:02,084 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-17 22:32:02,084 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-17 22:32:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:32:02,086 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-17 22:32:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-17 22:32:02,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:32:02,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:32:02,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:32:02,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:32:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:32:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-17 22:32:02,089 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2020-07-17 22:32:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:32:02,090 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-17 22:32:02,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:32:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-17 22:32:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:32:02,091 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:32:02,091 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] [2020-07-17 22:32:02,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:32:02,091 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:32:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:32:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1407314597, now seen corresponding path program 1 times [2020-07-17 22:32:02,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:32:02,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470250285] [2020-07-17 22:32:02,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:32:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:32:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:32:02,162 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:32:02,162 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:32:02,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:32:02,190 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-17 22:32:02,191 WARN L170 areAnnotationChecker]: L1008-5 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1001-3 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-17 22:32:02,192 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1019-2 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-17 22:32:02,193 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1008-1 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-17 22:32:02,194 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1024-3 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-17 22:32:02,195 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-17 22:32:02,196 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-17 22:32:02,198 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-17 22:32:02,198 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-17 22:32:02,198 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1021-4 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1026-4 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2020-07-17 22:32:02,199 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-17 22:32:02,200 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-17 22:32:02,200 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-17 22:32:02,200 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-17 22:32:02,200 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-17 22:32:02,200 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: L1036-3 has no Hoare annotation [2020-07-17 22:32:02,202 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:32:02,203 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:32:02,203 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-17 22:32:02,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:32:02 BoogieIcfgContainer [2020-07-17 22:32:02,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:32:02,211 INFO L168 Benchmark]: Toolchain (without parser) took 5615.60 ms. Allocated memory was 137.9 MB in the beginning and 286.3 MB in the end (delta: 148.4 MB). Free memory was 101.1 MB in the beginning and 225.6 MB in the end (delta: -124.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:32:02,211 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:32:02,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.78 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 166.6 MB in the end (delta: -66.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:32:02,213 INFO L168 Benchmark]: Boogie Preprocessor took 84.67 ms. Allocated memory is still 200.8 MB. Free memory was 166.6 MB in the beginning and 162.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:32:02,215 INFO L168 Benchmark]: RCFGBuilder took 822.66 ms. Allocated memory is still 200.8 MB. Free memory was 162.7 MB in the beginning and 102.2 MB in the end (delta: 60.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:32:02,219 INFO L168 Benchmark]: TraceAbstraction took 4040.20 ms. Allocated memory was 200.8 MB in the beginning and 286.3 MB in the end (delta: 85.5 MB). Free memory was 102.2 MB in the beginning and 225.6 MB in the end (delta: -123.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:32:02,224 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.52 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 660.78 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 166.6 MB in the end (delta: -66.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.67 ms. Allocated memory is still 200.8 MB. Free memory was 166.6 MB in the beginning and 162.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.66 ms. Allocated memory is still 200.8 MB. Free memory was 162.7 MB in the beginning and 102.2 MB in the end (delta: 60.4 MB). Peak memory consumption was 60.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4040.20 ms. Allocated memory was 200.8 MB in the beginning and 286.3 MB in the end (delta: 85.5 MB). Free memory was 102.2 MB in the beginning and 225.6 MB in the end (delta: -123.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); [L994] head->next = ((void*)0) [L995] head->prev = ((void*)0) [L996] head->data = 0 [L998] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1010] x->data = 1 [L1011] x->next = malloc(sizeof(SLL)) [L1012] EXPR x->next [L1012] x->next->prev = x [L1013] EXPR x->next [L1013] x->next->data = 2 [L1015] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) [L1024] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) [L1025] EXPR x->next [L1025] x = x->next [L1026] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) [L1026] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 175 SDtfs, 91 SDslu, 234 SDs, 0 SdLazy, 350 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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...