/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/list-properties/simple-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:05:13,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:05:13,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:05:13,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:05:13,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:05:13,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:05:13,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:05:13,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:05:13,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:05:13,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:05:13,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:05:13,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:05:13,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:05:13,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:05:13,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:05:13,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:05:13,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:05:13,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:05:13,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:05:13,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:05:13,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:05:13,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:05:13,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:05:13,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:05:13,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:05:13,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:05:13,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:05:13,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:05:13,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:05:13,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:05:13,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:05:13,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:05:13,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:05:13,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:05:13,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:05:13,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:05:13,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:05:13,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:05:13,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:05:13,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:05:13,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:05:13,373 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-10 15:05:13,393 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:05:13,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:05:13,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:05:13,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:05:13,397 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:05:13,397 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:05:13,397 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:05:13,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:05:13,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:05:13,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:05:13,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:05:13,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:05:13,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:05:13,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:05:13,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:05:13,400 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:05:13,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:05:13,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:05:13,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:05:13,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:05:13,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:05:13,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:05:13,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:05:13,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:05:13,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:05:13,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:05:13,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:05:13,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:05:13,404 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:05:13,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:05:13,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:05:13,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:05:13,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:05:13,719 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:05:13,719 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:05:13,720 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple-1.i [2020-07-10 15:05:13,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0013f3c4/217e2d0b497b4cd0bd584a7027d35c3f/FLAGbde1290a1 [2020-07-10 15:05:14,275 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:05:14,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple-1.i [2020-07-10 15:05:14,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0013f3c4/217e2d0b497b4cd0bd584a7027d35c3f/FLAGbde1290a1 [2020-07-10 15:05:14,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0013f3c4/217e2d0b497b4cd0bd584a7027d35c3f [2020-07-10 15:05:14,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:05:14,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:05:14,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:14,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:05:14,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:05:14,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:14" (1/1) ... [2020-07-10 15:05:14,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a25b02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:14, skipping insertion in model container [2020-07-10 15:05:14,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:14" (1/1) ... [2020-07-10 15:05:14,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:05:14,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:05:14,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:15,108 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:05:15,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:15,254 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:05:15,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15 WrapperNode [2020-07-10 15:05:15,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:15,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:05:15,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:05:15,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:05:15,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (1/1) ... [2020-07-10 15:05:15,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:05:15,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:05:15,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:05:15,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:05:15,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (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-10 15:05:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:05:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:05:15,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-10 15:05:15,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-10 15:05:15,386 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-10 15:05:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-10 15:05:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-10 15:05:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-10 15:05:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-10 15:05:15,391 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-10 15:05:15,392 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-10 15:05:15,393 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-10 15:05:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-10 15:05:15,395 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-10 15:05:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-10 15:05:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-10 15:05:15,398 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-10 15:05:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-10 15:05:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-10 15:05:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-10 15:05:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:05:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:05:15,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:05:15,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:05:15,760 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-10 15:05:15,985 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:05:15,986 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:05:15,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:15 BoogieIcfgContainer [2020-07-10 15:05:15,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:05:15,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:05:15,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:05:15,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:05:16,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:05:14" (1/3) ... [2020-07-10 15:05:16,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49698933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:16, skipping insertion in model container [2020-07-10 15:05:16,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:15" (2/3) ... [2020-07-10 15:05:16,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49698933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:16, skipping insertion in model container [2020-07-10 15:05:16,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:15" (3/3) ... [2020-07-10 15:05:16,008 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-1.i [2020-07-10 15:05:16,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:05:16,038 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:05:16,052 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:05:16,077 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:05:16,077 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:05:16,078 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:05:16,078 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:05:16,078 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:05:16,078 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:05:16,078 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:05:16,079 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:05:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-10 15:05:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:05:16,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:16,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:16,109 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1710443637, now seen corresponding path program 1 times [2020-07-10 15:05:16,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:16,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189244809] [2020-07-10 15:05:16,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:16,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#(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; {30#true} is VALID [2020-07-10 15:05:16,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 15:05:16,334 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #80#return; {30#true} is VALID [2020-07-10 15:05:16,338 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {35#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:16,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(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; {30#true} is VALID [2020-07-10 15:05:16,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-10 15:05:16,339 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #80#return; {30#true} is VALID [2020-07-10 15:05:16,340 INFO L263 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret8 := main(); {30#true} is VALID [2020-07-10 15:05:16,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {30#true} is VALID [2020-07-10 15:05:16,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {30#true} is VALID [2020-07-10 15:05:16,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {30#true} is VALID [2020-07-10 15:05:16,342 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} assume !true; {31#false} is VALID [2020-07-10 15:05:16,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {31#false} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {31#false} is VALID [2020-07-10 15:05:16,343 INFO L280 TraceCheckUtils]: 10: Hoare triple {31#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {31#false} is VALID [2020-07-10 15:05:16,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#false} assume 2 != #t~mem6;havoc #t~mem6; {31#false} is VALID [2020-07-10 15:05:16,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-10 15:05:16,345 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-10 15:05:16,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189244809] [2020-07-10 15:05:16,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:16,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:05:16,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762561805] [2020-07-10 15:05:16,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:05:16,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:16,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:05:16,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:16,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:05:16,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:16,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:05:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:05:16,400 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2020-07-10 15:05:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,615 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-10 15:05:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:05:16,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-10 15:05:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2020-07-10 15:05:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:05:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2020-07-10 15:05:16,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2020-07-10 15:05:16,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:16,728 INFO L225 Difference]: With dead ends: 38 [2020-07-10 15:05:16,728 INFO L226 Difference]: Without dead ends: 18 [2020-07-10 15:05:16,732 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-10 15:05:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-10 15:05:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-10 15:05:16,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:16,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-10 15:05:16,773 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:05:16,774 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:05:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,777 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:05:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:05:16,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:16,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:16,778 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-10 15:05:16,778 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-10 15:05:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:16,782 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-10 15:05:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:05:16,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:16,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:16,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:16,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:05:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:05:16,787 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-10 15:05:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:16,787 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:05:16,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:05:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:05:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:05:16,788 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:16,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:16,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:05:16,789 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1041507629, now seen corresponding path program 1 times [2020-07-10 15:05:16,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:16,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162307998] [2020-07-10 15:05:16,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:16,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {155#(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; {147#true} is VALID [2020-07-10 15:05:16,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2020-07-10 15:05:16,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #80#return; {147#true} is VALID [2020-07-10 15:05:16,951 INFO L263 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {155#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:16,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {155#(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; {147#true} is VALID [2020-07-10 15:05:16,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2020-07-10 15:05:16,952 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #80#return; {147#true} is VALID [2020-07-10 15:05:16,952 INFO L263 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret8 := main(); {147#true} is VALID [2020-07-10 15:05:16,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {147#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {147#true} is VALID [2020-07-10 15:05:16,953 INFO L280 TraceCheckUtils]: 6: Hoare triple {147#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {147#true} is VALID [2020-07-10 15:05:16,954 INFO L280 TraceCheckUtils]: 7: Hoare triple {147#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:16,955 INFO L280 TraceCheckUtils]: 8: Hoare triple {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:16,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-10 15:05:16,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {152#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {153#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-10 15:05:16,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {153#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {154#(= 2 |main_#t~mem6|)} is VALID [2020-07-10 15:05:16,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {154#(= 2 |main_#t~mem6|)} assume 2 != #t~mem6;havoc #t~mem6; {148#false} is VALID [2020-07-10 15:05:16,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {148#false} assume !false; {148#false} is VALID [2020-07-10 15:05:16,961 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-10 15:05:16,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162307998] [2020-07-10 15:05:16,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:16,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:05:16,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648181024] [2020-07-10 15:05:16,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:05:16,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:16,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:05:16,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:16,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:05:16,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:05:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:05:16,990 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-07-10 15:05:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:17,327 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-10 15:05:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:05:17,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-10 15:05:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-10 15:05:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:05:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2020-07-10 15:05:17,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2020-07-10 15:05:17,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:17,391 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:05:17,392 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:05:17,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:05:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:05:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-07-10 15:05:17,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:17,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2020-07-10 15:05:17,414 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2020-07-10 15:05:17,414 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2020-07-10 15:05:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:17,419 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:05:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:05:17,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:17,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:17,420 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2020-07-10 15:05:17,420 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2020-07-10 15:05:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:17,425 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 15:05:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-10 15:05:17,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:17,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:17,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:17,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:05:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 15:05:17,431 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2020-07-10 15:05:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:17,432 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 15:05:17,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:05:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 15:05:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:05:17,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:17,433 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:17,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:05:17,434 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 714847529, now seen corresponding path program 1 times [2020-07-10 15:05:17,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:17,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751955545] [2020-07-10 15:05:17,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {306#(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; {297#true} is VALID [2020-07-10 15:05:17,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2020-07-10 15:05:17,675 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #80#return; {297#true} is VALID [2020-07-10 15:05:17,676 INFO L263 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {306#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:05:17,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#(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; {297#true} is VALID [2020-07-10 15:05:17,677 INFO L280 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2020-07-10 15:05:17,677 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #80#return; {297#true} is VALID [2020-07-10 15:05:17,678 INFO L263 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret8 := main(); {297#true} is VALID [2020-07-10 15:05:17,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {297#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {302#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:05:17,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {302#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {302#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:05:17,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {302#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:17,684 INFO L280 TraceCheckUtils]: 8: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:17,684 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:17,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:17,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:17,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem6);havoc #t~mem6; {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:17,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {305#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-10 15:05:17,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {305#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {298#false} is VALID [2020-07-10 15:05:17,705 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#false} assume 2 != #t~mem6;havoc #t~mem6; {298#false} is VALID [2020-07-10 15:05:17,705 INFO L280 TraceCheckUtils]: 16: Hoare triple {298#false} assume !false; {298#false} is VALID [2020-07-10 15:05:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:17,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751955545] [2020-07-10 15:05:17,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439344633] [2020-07-10 15:05:17,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:05:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:05:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:17,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:17,942 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:05:17,943 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,952 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,956 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:05:17,956 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,964 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:17,964 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:17,965 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-10 15:05:18,014 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:05:18,016 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:18,023 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:18,026 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:05:18,027 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:18,032 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:18,033 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:18,033 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-10 15:05:18,036 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:18,037 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4))) (and (= .cse0 main_~p~0.base) (= 0 .cse1) (= .cse1 main_~p~0.offset) (= 0 .cse0))) [2020-07-10 15:05:18,037 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.offset) (= 0 main_~p~0.base)) [2020-07-10 15:05:18,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2020-07-10 15:05:18,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {297#true} is VALID [2020-07-10 15:05:18,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2020-07-10 15:05:18,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #80#return; {297#true} is VALID [2020-07-10 15:05:18,042 INFO L263 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret8 := main(); {297#true} is VALID [2020-07-10 15:05:18,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {297#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {302#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:05:18,044 INFO L280 TraceCheckUtils]: 6: Hoare triple {302#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {302#(= 0 main_~a~0.offset)} is VALID [2020-07-10 15:05:18,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {302#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset;call write~int(2, ~a~0.base, ~a~0.offset, 4); {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:18,046 INFO L280 TraceCheckUtils]: 8: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:18,047 INFO L280 TraceCheckUtils]: 9: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} is VALID [2020-07-10 15:05:18,049 INFO L280 TraceCheckUtils]: 10: Hoare triple {303#(and (= main_~a~0.base main_~p~0.base) (= 0 main_~p~0.offset) (= 0 main_~a~0.offset))} call write~int(2, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:18,050 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:18,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(2 != #t~mem6);havoc #t~mem6; {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2020-07-10 15:05:18,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {304#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= 0 main_~p~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {305#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-10 15:05:18,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {305#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem6 := read~int(~p~0.base, ~p~0.offset, 4); {298#false} is VALID [2020-07-10 15:05:18,054 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#false} assume 2 != #t~mem6;havoc #t~mem6; {298#false} is VALID [2020-07-10 15:05:18,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {298#false} assume !false; {298#false} is VALID [2020-07-10 15:05:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:18,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:05:18,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2020-07-10 15:05:18,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018403669] [2020-07-10 15:05:18,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:05:18,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:18,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:05:18,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:05:18,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:05:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:05:18,084 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2020-07-10 15:05:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:18,371 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-10 15:05:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:05:18,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-07-10 15:05:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:05:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-10 15:05:18,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-10 15:05:18,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:18,439 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:05:18,439 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 15:05:18,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:05:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 15:05:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2020-07-10 15:05:18,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:18,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2020-07-10 15:05:18,456 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2020-07-10 15:05:18,456 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2020-07-10 15:05:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:18,459 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 15:05:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:05:18,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:18,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:18,460 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2020-07-10 15:05:18,460 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2020-07-10 15:05:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:18,462 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-10 15:05:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-10 15:05:18,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:18,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:18,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:18,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:05:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-10 15:05:18,465 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2020-07-10 15:05:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:18,465 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-10 15:05:18,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:05:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-10 15:05:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:05:18,466 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:18,466 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:18,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:05:18,679 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -158216428, now seen corresponding path program 1 times [2020-07-10 15:05:18,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:18,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687532514] [2020-07-10 15:05:18,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:05:18,754 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:05:18,754 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:05:18,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:05:18,790 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-10 15:05:18,791 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-10 15:05:18,792 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L522 has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L522-1 has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L522-3 has no Hoare annotation [2020-07-10 15:05:18,793 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L526-3 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L526-4 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L526-1 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L536-2 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2020-07-10 15:05:18,794 WARN L170 areAnnotationChecker]: L536-3 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L537 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L537 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L529-1 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L529-3 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L538 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L538 has no Hoare annotation [2020-07-10 15:05:18,795 WARN L170 areAnnotationChecker]: L537-2 has no Hoare annotation [2020-07-10 15:05:18,796 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:18,796 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-10 15:05:18,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:18 BoogieIcfgContainer [2020-07-10 15:05:18,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:18,813 INFO L168 Benchmark]: Toolchain (without parser) took 4220.63 ms. Allocated memory was 145.8 MB in the beginning and 245.9 MB in the end (delta: 100.1 MB). Free memory was 103.2 MB in the beginning and 214.5 MB in the end (delta: -111.4 MB). Peak memory consumption was 110.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,814 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.81 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 103.0 MB in the beginning and 170.7 MB in the end (delta: -67.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,816 INFO L168 Benchmark]: Boogie Preprocessor took 64.83 ms. Allocated memory is still 204.5 MB. Free memory was 170.7 MB in the beginning and 168.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,817 INFO L168 Benchmark]: RCFGBuilder took 670.81 ms. Allocated memory is still 204.5 MB. Free memory was 168.0 MB in the beginning and 117.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,818 INFO L168 Benchmark]: TraceAbstraction took 2803.11 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 117.1 MB in the beginning and 92.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:18,821 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.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 661.81 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 103.0 MB in the beginning and 170.7 MB in the end (delta: -67.8 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.83 ms. Allocated memory is still 204.5 MB. Free memory was 170.7 MB in the beginning and 168.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 670.81 ms. Allocated memory is still 204.5 MB. Free memory was 168.0 MB in the beginning and 117.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2803.11 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 117.1 MB in the beginning and 92.4 MB in the end (delta: 24.6 MB). Peak memory consumption was 65.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 538]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L522] COND FALSE !(a == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}] [L523] List t; [L524] List p = a; [L525] a->h = 2 VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] p->h = 1 [L528] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L529] COND FALSE !(t == 0) VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L530] p->n = t [L531] EXPR p->n [L531] p = p->n [L526] COND FALSE !(__VERIFIER_nondet_int()) [L533] p->h = 2 [L534] p->n = 0 [L535] p = a VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L536] COND TRUE p!=0 [L537] EXPR p->h VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=1, t={-2:0}] [L537] COND TRUE p->h != 2 [L538] __VERIFIER_error() VAL [a={-1:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 51 SDtfs, 41 SDslu, 73 SDs, 0 SdLazy, 122 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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, 3 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4732 SizeOfPredicates, 7 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...