/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/ldv-regression/rule60_list.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:05:52,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:05:52,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:05:52,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:05:52,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:05:52,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:05:52,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:05:52,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:05:52,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:05:52,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:05:52,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:05:52,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:05:52,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:05:52,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:05:52,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:05:52,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:05:52,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:05:52,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:05:52,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:05:52,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:05:52,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:05:52,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:05:52,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:05:52,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:05:52,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:05:52,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:05:52,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:05:52,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:05:52,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:05:52,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:05:52,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:05:52,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:05:52,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:05:52,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:05:52,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:05:52,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:05:52,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:05:52,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:05:52,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:05:52,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:05:52,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:05:52,519 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:52,534 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:05:52,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:05:52,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:05:52,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:05:52,535 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:05:52,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:05:52,536 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:05:52,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:05:52,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:05:52,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:05:52,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:05:52,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:05:52,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:05:52,537 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:05:52,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:05:52,538 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:05:52,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:05:52,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:05:52,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:05:52,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:05:52,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:05:52,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:05:52,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:05:52,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:05:52,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:05:52,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:05:52,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:05:52,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:05:52,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:05:52,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:05:52,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:05:52,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:05:52,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:05:52,847 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:05:52,847 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:05:52,848 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-10 15:05:52,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02961884f/3ba96718416e4a5096dfa02e080afa79/FLAG4a41fafb1 [2020-07-10 15:05:53,417 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:05:53,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list.i [2020-07-10 15:05:53,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02961884f/3ba96718416e4a5096dfa02e080afa79/FLAG4a41fafb1 [2020-07-10 15:05:53,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02961884f/3ba96718416e4a5096dfa02e080afa79 [2020-07-10 15:05:53,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:05:53,792 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:05:53,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:53,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:05:53,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:05:53,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:53" (1/1) ... [2020-07-10 15:05:53,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e62222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:53, skipping insertion in model container [2020-07-10 15:05:53,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:05:53" (1/1) ... [2020-07-10 15:05:53,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:05:53,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:05:54,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:54,297 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:05:54,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:05:54,417 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:05:54,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54 WrapperNode [2020-07-10 15:05:54,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:05:54,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:05:54,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:05:54,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:05:54,432 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:54" (1/1) ... [2020-07-10 15:05:54,432 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:54" (1/1) ... [2020-07-10 15:05:54,448 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:54" (1/1) ... [2020-07-10 15:05:54,448 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:54" (1/1) ... [2020-07-10 15:05:54,469 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:54" (1/1) ... [2020-07-10 15:05:54,471 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:54" (1/1) ... [2020-07-10 15:05:54,474 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:54" (1/1) ... [2020-07-10 15:05:54,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:05:54,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:05:54,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:05:54,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:05:54,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54" (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:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:05:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:05:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-07-10 15:05:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-07-10 15:05:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-07-10 15:05:54,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-07-10 15:05:54,557 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-07-10 15:05:54,558 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-07-10 15:05:54,559 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-07-10 15:05:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-07-10 15:05:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-07-10 15:05:54,560 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-07-10 15:05:54,561 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-07-10 15:05:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-07-10 15:05:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-07-10 15:05:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-07-10 15:05:54,562 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-07-10 15:05:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-07-10 15:05:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-07-10 15:05:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-07-10 15:05:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-07-10 15:05:54,563 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-07-10 15:05:54,564 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-07-10 15:05:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-07-10 15:05:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-07-10 15:05:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-07-10 15:05:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-07-10 15:05:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-07-10 15:05:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-07-10 15:05:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-07-10 15:05:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-07-10 15:05:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-07-10 15:05:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-07-10 15:05:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-07-10 15:05:54,569 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-07-10 15:05:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-07-10 15:05:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-07-10 15:05:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-07-10 15:05:54,570 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-07-10 15:05:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-07-10 15:05:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-07-10 15:05:54,571 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-07-10 15:05:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-07-10 15:05:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-07-10 15:05:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-07-10 15:05:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-07-10 15:05:54,573 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-07-10 15:05:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-07-10 15:05:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-07-10 15:05:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-07-10 15:05:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-07-10 15:05:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-07-10 15:05:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-07-10 15:05:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-10 15:05:54,577 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-07-10 15:05:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-10 15:05:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-07-10 15:05:54,578 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-07-10 15:05:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-07-10 15:05:54,579 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-07-10 15:05:54,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-07-10 15:05:54,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-07-10 15:05:54,580 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-07-10 15:05:54,581 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-07-10 15:05:54,581 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-07-10 15:05:54,581 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-07-10 15:05:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-07-10 15:05:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-07-10 15:05:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:05:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:05:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-10 15:05:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-07-10 15:05:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:05:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:05:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:05:54,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:05:55,108 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:05:55,108 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:05:55,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:55 BoogieIcfgContainer [2020-07-10 15:05:55,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:05:55,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:05:55,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:05:55,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:05:55,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:05:53" (1/3) ... [2020-07-10 15:05:55,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4603f85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:55, skipping insertion in model container [2020-07-10 15:05:55,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:05:54" (2/3) ... [2020-07-10 15:05:55,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4603f85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:05:55, skipping insertion in model container [2020-07-10 15:05:55,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:05:55" (3/3) ... [2020-07-10 15:05:55,125 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list.i [2020-07-10 15:05:55,135 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:05:55,144 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:05:55,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:05:55,185 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:05:55,185 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:05:55,185 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:05:55,185 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:05:55,186 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:05:55,186 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:05:55,186 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:05:55,186 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:05:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-10 15:05:55,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:05:55,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:55,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:55,223 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:55,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2070742689, now seen corresponding path program 1 times [2020-07-10 15:05:55,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:55,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651290830] [2020-07-10 15:05:55,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:55,704 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {34#true} is VALID [2020-07-10 15:05:55,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-10 15:05:55,705 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #51#return; {34#true} is VALID [2020-07-10 15:05:55,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 15:05:55,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {34#true} is VALID [2020-07-10 15:05:55,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-10 15:05:55,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #51#return; {34#true} is VALID [2020-07-10 15:05:55,711 INFO L263 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret31 := main(); {34#true} is VALID [2020-07-10 15:05:55,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {39#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:55,715 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0;call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); {40#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 15:05:55,717 INFO L263 TraceCheckUtils]: 7: Hoare triple {40#(and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {41#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-10 15:05:55,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {42#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-10 15:05:55,721 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {35#false} is VALID [2020-07-10 15:05:55,721 INFO L263 TraceCheckUtils]: 10: Hoare triple {35#false} call __blast_assert(); {35#false} is VALID [2020-07-10 15:05:55,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-10 15:05:55,723 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:55,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651290830] [2020-07-10 15:05:55,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:55,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:05:55,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369058928] [2020-07-10 15:05:55,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:05:55,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:55,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:05:55,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:55,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:05:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:55,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:05:55,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:05:55,781 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 7 states. [2020-07-10 15:05:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:56,331 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-07-10 15:05:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:05:56,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:05:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 15:05:56,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2020-07-10 15:05:56,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2020-07-10 15:05:56,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:56,471 INFO L225 Difference]: With dead ends: 55 [2020-07-10 15:05:56,472 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:05:56,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:05:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-10 15:05:56,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:56,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-10 15:05:56,544 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:05:56,544 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:05:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:56,549 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:05:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:05:56,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:56,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:56,550 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:05:56,550 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:05:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:56,554 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 15:05:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:05:56,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:56,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:56,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:56,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:05:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-10 15:05:56,560 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2020-07-10 15:05:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:56,561 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-10 15:05:56,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:05:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-10 15:05:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:05:56,562 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:56,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:56,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:05:56,563 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1302580324, now seen corresponding path program 1 times [2020-07-10 15:05:56,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:56,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445307123] [2020-07-10 15:05:56,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:56,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {218#true} is VALID [2020-07-10 15:05:56,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-10 15:05:56,746 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #51#return; {218#true} is VALID [2020-07-10 15:05:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:56,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {233#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 15:05:56,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 15:05:56,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28;call write~int(1, ~new.base, 8 + ~new.offset, 4); {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 15:05:56,911 INFO L280 TraceCheckUtils]: 3: Hoare triple {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 15:05:56,913 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {223#(= 0 main_~dev~0.offset)} #41#return; {229#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 15:05:56,915 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 15:05:56,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {218#true} is VALID [2020-07-10 15:05:56,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-10 15:05:56,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #51#return; {218#true} is VALID [2020-07-10 15:05:56,917 INFO L263 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret31 := main(); {218#true} is VALID [2020-07-10 15:05:56,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {223#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:56,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {223#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0;call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); {223#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:56,929 INFO L263 TraceCheckUtils]: 7: Hoare triple {223#(= 0 main_~dev~0.offset)} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {233#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:05:56,930 INFO L280 TraceCheckUtils]: 8: Hoare triple {233#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 15:05:56,931 INFO L280 TraceCheckUtils]: 9: Hoare triple {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} assume 0 == #t~mem28; {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} is VALID [2020-07-10 15:05:56,933 INFO L280 TraceCheckUtils]: 10: Hoare triple {234#(and (or (<= |list_add_#in~new.offset| list_add_~new.offset) (< 0 (+ list_add_~new.offset 1))) (or (<= list_add_~new.offset |list_add_#in~new.offset|) (<= list_add_~new.offset 0)) (or (= list_add_~new.base |list_add_#in~new.base|) (not (= 0 list_add_~new.offset))))} havoc #t~mem28;call write~int(1, ~new.base, 8 + ~new.offset, 4); {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 15:05:56,934 INFO L280 TraceCheckUtils]: 11: Hoare triple {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} assume true; {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} is VALID [2020-07-10 15:05:56,936 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {235#(or (= 1 (select (select |#memory_int| |list_add_#in~new.base|) 8)) (<= (+ |list_add_#in~new.offset| 1) 0) (<= 1 |list_add_#in~new.offset|))} {223#(= 0 main_~dev~0.offset)} #41#return; {229#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 15:05:56,937 INFO L263 TraceCheckUtils]: 13: Hoare triple {229#(and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} call list_del(~dev~0.base, ~dev~0.offset); {230#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} is VALID [2020-07-10 15:05:56,938 INFO L280 TraceCheckUtils]: 14: Hoare triple {230#(and (= 1 (select (select |#memory_int| |list_del_#in~entry.base|) 8)) (= 0 |list_del_#in~entry.offset|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); {231#(= 1 |list_del_#t~mem29|)} is VALID [2020-07-10 15:05:56,939 INFO L280 TraceCheckUtils]: 15: Hoare triple {231#(= 1 |list_del_#t~mem29|)} assume !(1 == #t~mem29); {219#false} is VALID [2020-07-10 15:05:56,939 INFO L263 TraceCheckUtils]: 16: Hoare triple {219#false} call __blast_assert(); {219#false} is VALID [2020-07-10 15:05:56,939 INFO L280 TraceCheckUtils]: 17: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-10 15:05:56,941 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:56,942 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445307123] [2020-07-10 15:05:56,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:05:56,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 15:05:56,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721504472] [2020-07-10 15:05:56,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:05:56,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:56,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:05:56,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:56,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:05:56,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:05:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:05:56,981 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2020-07-10 15:05:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,835 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-10 15:05:57,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:05:57,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-07-10 15:05:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2020-07-10 15:05:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:05:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2020-07-10 15:05:57,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2020-07-10 15:05:57,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:57,900 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:05:57,900 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:05:57,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:05:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:05:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:05:57,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:57,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:05:57,958 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:05:57,958 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:05:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,960 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 15:05:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 15:05:57,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,962 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:05:57,962 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:05:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:57,966 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 15:05:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 15:05:57,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:57,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:57,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:57,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:05:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2020-07-10 15:05:57,973 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 18 [2020-07-10 15:05:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:57,974 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2020-07-10 15:05:57,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:05:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2020-07-10 15:05:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:05:57,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:05:57,976 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:05:57,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:05:57,976 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:05:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:05:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1070618069, now seen corresponding path program 1 times [2020-07-10 15:05:57,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:05:57,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580184669] [2020-07-10 15:05:57,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:05:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {399#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {380#true} {380#true} #51#return; {380#true} is VALID [2020-07-10 15:05:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {380#true} assume 0 == #t~mem28; {380#true} is VALID [2020-07-10 15:05:58,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#true} havoc #t~mem28;call write~int(1, ~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,161 INFO L280 TraceCheckUtils]: 3: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,162 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {380#true} {385#(= 0 main_~dev~0.offset)} #41#return; {385#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,237 INFO L280 TraceCheckUtils]: 0: Hoare triple {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 15:05:58,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} assume 1 == #t~mem29; {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 15:05:58,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} havoc #t~mem29;call write~int(0, ~entry.base, 8 + ~entry.offset, 4); {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 15:05:58,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 15:05:58,243 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {385#(= 0 main_~dev~0.offset)} #43#return; {396#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 15:05:58,245 INFO L263 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {399#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} is VALID [2020-07-10 15:05:58,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {399#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#head~0.base| |old(~#head~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,246 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {380#true} {380#true} #51#return; {380#true} is VALID [2020-07-10 15:05:58,246 INFO L263 TraceCheckUtils]: 4: Hoare triple {380#true} call #t~ret31 := main(); {380#true} is VALID [2020-07-10 15:05:58,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {380#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {385#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:58,248 INFO L280 TraceCheckUtils]: 6: Hoare triple {385#(= 0 main_~dev~0.offset)} assume ~dev~0.base != 0 || ~dev~0.offset != 0;call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); {385#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:58,249 INFO L263 TraceCheckUtils]: 7: Hoare triple {385#(= 0 main_~dev~0.offset)} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:05:58,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {380#true} assume 0 == #t~mem28; {380#true} is VALID [2020-07-10 15:05:58,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {380#true} havoc #t~mem28;call write~int(1, ~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,250 INFO L280 TraceCheckUtils]: 11: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,257 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {380#true} {385#(= 0 main_~dev~0.offset)} #41#return; {385#(= 0 main_~dev~0.offset)} is VALID [2020-07-10 15:05:58,258 INFO L263 TraceCheckUtils]: 13: Hoare triple {385#(= 0 main_~dev~0.offset)} call list_del(~dev~0.base, ~dev~0.offset); {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:05:58,258 INFO L280 TraceCheckUtils]: 14: Hoare triple {400#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 15:05:58,259 INFO L280 TraceCheckUtils]: 15: Hoare triple {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} assume 1 == #t~mem29; {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} is VALID [2020-07-10 15:05:58,261 INFO L280 TraceCheckUtils]: 16: Hoare triple {401#(and (or (= 0 list_del_~entry.offset) (= |list_del_#in~entry.offset| list_del_~entry.offset)) (or (= list_del_~entry.base |list_del_#in~entry.base|) (not (= 0 list_del_~entry.offset))))} havoc #t~mem29;call write~int(0, ~entry.base, 8 + ~entry.offset, 4); {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 15:05:58,262 INFO L280 TraceCheckUtils]: 17: Hoare triple {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} assume true; {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} is VALID [2020-07-10 15:05:58,266 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {402#(or (not (= 0 |list_del_#in~entry.offset|)) (= 0 (select (select |#memory_int| |list_del_#in~entry.base|) 8)))} {385#(= 0 main_~dev~0.offset)} #43#return; {396#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} is VALID [2020-07-10 15:05:58,268 INFO L263 TraceCheckUtils]: 19: Hoare triple {396#(and (= 0 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {397#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} is VALID [2020-07-10 15:05:58,270 INFO L280 TraceCheckUtils]: 20: Hoare triple {397#(and (= 0 |list_add_#in~new.offset|) (= 0 (select (select |#memory_int| |list_add_#in~new.base|) 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {398#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-10 15:05:58,271 INFO L280 TraceCheckUtils]: 21: Hoare triple {398#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {381#false} is VALID [2020-07-10 15:05:58,272 INFO L263 TraceCheckUtils]: 22: Hoare triple {381#false} call __blast_assert(); {381#false} is VALID [2020-07-10 15:05:58,272 INFO L280 TraceCheckUtils]: 23: Hoare triple {381#false} assume !false; {381#false} is VALID [2020-07-10 15:05:58,274 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:58,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580184669] [2020-07-10 15:05:58,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268050050] [2020-07-10 15:05:58,275 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:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-10 15:05:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:05:58,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:05:58,530 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 13 treesize of output 9 [2020-07-10 15:05:58,531 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:58,535 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:58,536 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:58,536 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-07-10 15:05:58,657 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 19 treesize of output 7 [2020-07-10 15:05:58,659 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:05:58,662 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:05:58,662 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:05:58,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-07-10 15:05:58,665 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:05:58,666 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |list_add_#in~new.base|, |list_add_#in~new.offset|]. (let ((.cse0 (select (select |#memory_int| |list_add_#in~new.base|) (+ |list_add_#in~new.offset| 8)))) (and (= .cse0 |list_add_#t~mem28|) (= 0 .cse0))) [2020-07-10 15:05:58,666 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |list_add_#t~mem28|) [2020-07-10 15:05:58,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {380#true} call ULTIMATE.init(); {380#true} is VALID [2020-07-10 15:05:58,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {380#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#head~0.base, ~#head~0.offset := #Ultimate.allocOnStack(12);call write~init~$Pointer$(0, 0, ~#head~0.base, ~#head~0.offset, 4);call write~init~$Pointer$(0, 0, ~#head~0.base, 4 + ~#head~0.offset, 4);call write~init~int(0, ~#head~0.base, 8 + ~#head~0.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,672 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,673 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {380#true} {380#true} #51#return; {380#true} is VALID [2020-07-10 15:05:58,673 INFO L263 TraceCheckUtils]: 4: Hoare triple {380#true} call #t~ret31 := main(); {380#true} is VALID [2020-07-10 15:05:58,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {380#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(12);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {380#true} is VALID [2020-07-10 15:05:58,674 INFO L280 TraceCheckUtils]: 6: Hoare triple {380#true} assume ~dev~0.base != 0 || ~dev~0.offset != 0;call write~int(0, ~dev~0.base, 8 + ~dev~0.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,674 INFO L263 TraceCheckUtils]: 7: Hoare triple {380#true} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {380#true} is VALID [2020-07-10 15:05:58,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {380#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {380#true} assume 0 == #t~mem28; {380#true} is VALID [2020-07-10 15:05:58,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {380#true} havoc #t~mem28;call write~int(1, ~new.base, 8 + ~new.offset, 4); {380#true} is VALID [2020-07-10 15:05:58,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {380#true} assume true; {380#true} is VALID [2020-07-10 15:05:58,676 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {380#true} {380#true} #41#return; {380#true} is VALID [2020-07-10 15:05:58,676 INFO L263 TraceCheckUtils]: 13: Hoare triple {380#true} call list_del(~dev~0.base, ~dev~0.offset); {380#true} is VALID [2020-07-10 15:05:58,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {380#true} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~int(~entry.base, 8 + ~entry.offset, 4); {448#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset))} is VALID [2020-07-10 15:05:58,678 INFO L280 TraceCheckUtils]: 15: Hoare triple {448#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset))} assume 1 == #t~mem29; {448#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset))} is VALID [2020-07-10 15:05:58,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {448#(and (= list_del_~entry.base |list_del_#in~entry.base|) (= |list_del_#in~entry.offset| list_del_~entry.offset))} havoc #t~mem29;call write~int(0, ~entry.base, 8 + ~entry.offset, 4); {455#(= 0 (select (select |#memory_int| |list_del_#in~entry.base|) (+ |list_del_#in~entry.offset| 8)))} is VALID [2020-07-10 15:05:58,681 INFO L280 TraceCheckUtils]: 17: Hoare triple {455#(= 0 (select (select |#memory_int| |list_del_#in~entry.base|) (+ |list_del_#in~entry.offset| 8)))} assume true; {455#(= 0 (select (select |#memory_int| |list_del_#in~entry.base|) (+ |list_del_#in~entry.offset| 8)))} is VALID [2020-07-10 15:05:58,683 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {455#(= 0 (select (select |#memory_int| |list_del_#in~entry.base|) (+ |list_del_#in~entry.offset| 8)))} {380#true} #43#return; {462#(= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8)))} is VALID [2020-07-10 15:05:58,684 INFO L263 TraceCheckUtils]: 19: Hoare triple {462#(= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8)))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {466#(= 0 (select (select |#memory_int| |list_add_#in~new.base|) (+ |list_add_#in~new.offset| 8)))} is VALID [2020-07-10 15:05:58,685 INFO L280 TraceCheckUtils]: 20: Hoare triple {466#(= 0 (select (select |#memory_int| |list_add_#in~new.base|) (+ |list_add_#in~new.offset| 8)))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~int(~new.base, 8 + ~new.offset, 4); {398#(= 0 |list_add_#t~mem28|)} is VALID [2020-07-10 15:05:58,686 INFO L280 TraceCheckUtils]: 21: Hoare triple {398#(= 0 |list_add_#t~mem28|)} assume !(0 == #t~mem28); {381#false} is VALID [2020-07-10 15:05:58,686 INFO L263 TraceCheckUtils]: 22: Hoare triple {381#false} call __blast_assert(); {381#false} is VALID [2020-07-10 15:05:58,687 INFO L280 TraceCheckUtils]: 23: Hoare triple {381#false} assume !false; {381#false} is VALID [2020-07-10 15:05:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:05:58,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:05:58,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2020-07-10 15:05:58,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857457625] [2020-07-10 15:05:58,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:05:58,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:05:58,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:05:58,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:58,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:05:58,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:05:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:05:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:05:58,725 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 7 states. [2020-07-10 15:05:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:58,971 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-07-10 15:05:58,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:05:58,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 15:05:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:05:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2020-07-10 15:05:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:05:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2020-07-10 15:05:58,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2020-07-10 15:05:59,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:05:59,006 INFO L225 Difference]: With dead ends: 25 [2020-07-10 15:05:59,006 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:05:59,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:05:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:05:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:05:59,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:05:59,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:59,007 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:59,008 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,008 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:59,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:59,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:59,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:05:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:05:59,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:05:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:59,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:05:59,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:05:59,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:05:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:05:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:05:59,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-10 15:05:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:05:59,011 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:05:59,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:05:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:05:59,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:05:59,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:05:59,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:05:59,440 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:59,440 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#head~0.base)| |~#head~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#head~0.offset| |old(~#head~0.offset)|)) [2020-07-10 15:05:59,441 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:59,441 INFO L268 CegarLoopResult]: For program point list_delFINAL(lines 871 874) no Hoare annotation was computed. [2020-07-10 15:05:59,441 INFO L268 CegarLoopResult]: For program point list_delEXIT(lines 871 874) no Hoare annotation was computed. [2020-07-10 15:05:59,441 INFO L268 CegarLoopResult]: For program point L872(line 872) no Hoare annotation was computed. [2020-07-10 15:05:59,441 INFO L264 CegarLoopResult]: At program point list_delENTRY(lines 871 874) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 15:05:59,441 INFO L264 CegarLoopResult]: At program point L872-2(line 872) the Hoare annotation is: (or (not (= 1 (select (select |old(#memory_int)| |list_del_#in~entry.base|) 8))) (not (= 0 |list_del_#in~entry.offset|))) [2020-07-10 15:05:59,442 INFO L268 CegarLoopResult]: For program point L872-3(line 872) no Hoare annotation was computed. [2020-07-10 15:05:59,442 INFO L264 CegarLoopResult]: At program point L867-2(line 867) the Hoare annotation is: (not (= (select (select |old(#memory_int)| |list_add_#in~new.base|) (+ |list_add_#in~new.offset| 8)) 0)) [2020-07-10 15:05:59,442 INFO L264 CegarLoopResult]: At program point list_addENTRY(lines 866 869) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= (select (select |old(#memory_int)| |list_add_#in~new.base|) (+ |list_add_#in~new.offset| 8)) 0))) [2020-07-10 15:05:59,442 INFO L268 CegarLoopResult]: For program point L867-3(line 867) no Hoare annotation was computed. [2020-07-10 15:05:59,442 INFO L268 CegarLoopResult]: For program point list_addFINAL(lines 866 869) no Hoare annotation was computed. [2020-07-10 15:05:59,442 INFO L268 CegarLoopResult]: For program point list_addEXIT(lines 866 869) no Hoare annotation was computed. [2020-07-10 15:05:59,442 INFO L268 CegarLoopResult]: For program point L867(line 867) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L271 CegarLoopResult]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:05:59,443 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:05:59,443 INFO L268 CegarLoopResult]: For program point L881(lines 881 886) no Hoare annotation was computed. [2020-07-10 15:05:59,444 INFO L268 CegarLoopResult]: For program point L881-1(lines 881 886) no Hoare annotation was computed. [2020-07-10 15:05:59,444 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 878 888) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:05:59,444 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 878 888) no Hoare annotation was computed. [2020-07-10 15:05:59,444 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 878 888) no Hoare annotation was computed. [2020-07-10 15:05:59,444 INFO L264 CegarLoopResult]: At program point L884(line 884) the Hoare annotation is: (and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset)) [2020-07-10 15:05:59,444 INFO L264 CegarLoopResult]: At program point L883(line 883) the Hoare annotation is: (and (= 0 (select (select |#memory_int| main_~dev~0.base) (+ main_~dev~0.offset 8))) (= 0 main_~dev~0.offset)) [2020-07-10 15:05:59,444 INFO L264 CegarLoopResult]: At program point L883-1(line 883) the Hoare annotation is: (and (= 1 (select (select |#memory_int| main_~dev~0.base) 8)) (= 0 main_~dev~0.offset)) [2020-07-10 15:05:59,449 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:59,449 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2020-07-10 15:05:59,450 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-10 15:05:59,450 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2020-07-10 15:05:59,451 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:59,452 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2020-07-10 15:05:59,452 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2020-07-10 15:05:59,452 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: L872-3 has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: L872-3 has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2020-07-10 15:05:59,453 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2020-07-10 15:05:59,454 WARN L170 areAnnotationChecker]: L867-3 has no Hoare annotation [2020-07-10 15:05:59,454 WARN L170 areAnnotationChecker]: L867-3 has no Hoare annotation [2020-07-10 15:05:59,455 WARN L170 areAnnotationChecker]: L881-1 has no Hoare annotation [2020-07-10 15:05:59,455 WARN L170 areAnnotationChecker]: list_delFINAL has no Hoare annotation [2020-07-10 15:05:59,455 WARN L170 areAnnotationChecker]: list_addFINAL has no Hoare annotation [2020-07-10 15:05:59,456 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:05:59,457 WARN L170 areAnnotationChecker]: list_delEXIT has no Hoare annotation [2020-07-10 15:05:59,457 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2020-07-10 15:05:59,457 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2020-07-10 15:05:59,457 WARN L170 areAnnotationChecker]: L881-1 has no Hoare annotation [2020-07-10 15:05:59,458 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:05:59,459 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:05:59,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:05:59 BoogieIcfgContainer [2020-07-10 15:05:59,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:05:59,465 INFO L168 Benchmark]: Toolchain (without parser) took 5672.69 ms. Allocated memory was 135.8 MB in the beginning and 305.7 MB in the end (delta: 169.9 MB). Free memory was 99.7 MB in the beginning and 160.7 MB in the end (delta: -60.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,465 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.14 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 163.7 MB in the end (delta: -64.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,467 INFO L168 Benchmark]: Boogie Preprocessor took 62.86 ms. Allocated memory is still 199.8 MB. Free memory was 163.7 MB in the beginning and 160.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,468 INFO L168 Benchmark]: RCFGBuilder took 631.86 ms. Allocated memory is still 199.8 MB. Free memory was 160.2 MB in the beginning and 111.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,469 INFO L168 Benchmark]: TraceAbstraction took 4346.61 ms. Allocated memory was 199.8 MB in the beginning and 305.7 MB in the end (delta: 105.9 MB). Free memory was 110.3 MB in the beginning and 160.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:05:59,472 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 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 625.14 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 99.5 MB in the beginning and 163.7 MB in the end (delta: -64.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.86 ms. Allocated memory is still 199.8 MB. Free memory was 163.7 MB in the beginning and 160.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 631.86 ms. Allocated memory is still 199.8 MB. Free memory was 160.2 MB in the beginning and 111.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4346.61 ms. Allocated memory was 199.8 MB in the beginning and 305.7 MB in the end (delta: 105.9 MB). Free memory was 110.3 MB in the beginning and 160.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 SDtfs, 45 SDslu, 134 SDs, 0 SdLazy, 212 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 21 PreInvPairs, 23 NumberOfFragments, 142 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 171 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 7905 SizeOfPredicates, 8 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3/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 correct! Received shutdown request...