java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:56:08,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:56:08,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:56:08,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:56:08,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:56:08,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:56:08,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:56:08,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:56:08,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:56:08,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:56:08,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:56:08,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:56:08,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:56:08,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:56:08,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:56:08,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:56:08,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:56:08,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:56:08,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:56:08,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:56:08,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:56:08,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:56:08,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:56:08,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:56:08,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:56:08,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:56:08,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:56:08,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:56:08,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:56:08,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:56:08,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:56:08,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:56:08,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:56:08,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:56:08,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:56:08,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:56:08,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:56:08,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:56:08,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:56:08,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:56:08,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:56:08,500 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 [2019-10-15 02:56:08,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:56:08,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:56:08,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:56:08,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:56:08,516 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:56:08,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:56:08,517 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:56:08,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:56:08,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:56:08,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:56:08,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:56:08,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:56:08,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:56:08,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:56:08,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:56:08,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:56:08,519 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:56:08,519 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:56:08,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:56:08,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:56:08,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:56:08,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:56:08,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:56:08,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:56:08,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:56:08,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:56:08,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:56:08,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:56:08,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:56:08,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:56:08,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:56:08,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:56:08,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:56:08,822 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:56:08,822 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-10-15 02:56:08,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c4989fb/b28ba566badc4d0e80f630257dd10380/FLAG456267558 [2019-10-15 02:56:09,400 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:56:09,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-10-15 02:56:09,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c4989fb/b28ba566badc4d0e80f630257dd10380/FLAG456267558 [2019-10-15 02:56:09,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c4989fb/b28ba566badc4d0e80f630257dd10380 [2019-10-15 02:56:09,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:56:09,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:56:09,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:56:09,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:56:09,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:56:09,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:56:09" (1/1) ... [2019-10-15 02:56:09,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e12d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:09, skipping insertion in model container [2019-10-15 02:56:09,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:56:09" (1/1) ... [2019-10-15 02:56:09,752 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:56:09,790 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:56:10,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:56:10,218 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:56:10,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:56:10,353 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:56:10,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10 WrapperNode [2019-10-15 02:56:10,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:56:10,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:56:10,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:56:10,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:56:10,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (1/1) ... [2019-10-15 02:56:10,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:56:10,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:56:10,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:56:10,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:56:10,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (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 [2019-10-15 02:56:10,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:56:10,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:56:10,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2019-10-15 02:56:10,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2019-10-15 02:56:10,482 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2019-10-15 02:56:10,482 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-10-15 02:56:10,482 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-15 02:56:10,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2019-10-15 02:56:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2019-10-15 02:56:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2019-10-15 02:56:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2019-10-15 02:56:10,486 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-10-15 02:56:10,487 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2019-10-15 02:56:10,488 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2019-10-15 02:56:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2019-10-15 02:56:10,490 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2019-10-15 02:56:10,491 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2019-10-15 02:56:10,492 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2019-10-15 02:56:10,493 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2019-10-15 02:56:10,494 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2019-10-15 02:56:10,495 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2019-10-15 02:56:10,496 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2019-10-15 02:56:10,497 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2019-10-15 02:56:10,498 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-15 02:56:10,499 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2019-10-15 02:56:10,500 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2019-10-15 02:56:10,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:56:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2019-10-15 02:56:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2019-10-15 02:56:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-10-15 02:56:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-15 02:56:10,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:56:10,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:56:11,089 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:56:11,089 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 02:56:11,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:56:11 BoogieIcfgContainer [2019-10-15 02:56:11,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:56:11,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:56:11,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:56:11,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:56:11,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:56:09" (1/3) ... [2019-10-15 02:56:11,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9157b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:56:11, skipping insertion in model container [2019-10-15 02:56:11,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:56:10" (2/3) ... [2019-10-15 02:56:11,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9157b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:56:11, skipping insertion in model container [2019-10-15 02:56:11,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:56:11" (3/3) ... [2019-10-15 02:56:11,101 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2019-10-15 02:56:11,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:56:11,118 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:56:11,129 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:56:11,154 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:56:11,154 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:56:11,154 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:56:11,154 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:56:11,155 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:56:11,155 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:56:11,155 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:56:11,155 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:56:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-15 02:56:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 02:56:11,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:56:11,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:56:11,182 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:56:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:56:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1762364833, now seen corresponding path program 1 times [2019-10-15 02:56:11,197 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:56:11,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632923194] [2019-10-15 02:56:11,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:11,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:56:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:56:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:56:11,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632923194] [2019-10-15 02:56:11,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:56:11,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:56:11,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520735554] [2019-10-15 02:56:11,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:56:11,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:56:11,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:56:11,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:56:11,452 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2019-10-15 02:56:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:56:11,604 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-10-15 02:56:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:56:11,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-10-15 02:56:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:56:11,618 INFO L225 Difference]: With dead ends: 66 [2019-10-15 02:56:11,618 INFO L226 Difference]: Without dead ends: 31 [2019-10-15 02:56:11,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:56:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-15 02:56:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-15 02:56:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 02:56:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-15 02:56:11,668 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 12 [2019-10-15 02:56:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:56:11,669 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-15 02:56:11,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:56:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-15 02:56:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 02:56:11,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:56:11,671 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:56:11,671 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:56:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:56:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 516237429, now seen corresponding path program 1 times [2019-10-15 02:56:11,672 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:56:11,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186905238] [2019-10-15 02:56:11,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:11,672 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:11,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:56:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:56:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-15 02:56:11,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186905238] [2019-10-15 02:56:11,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:56:11,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:56:11,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565856215] [2019-10-15 02:56:11,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:56:11,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:56:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:56:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:56:11,865 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2019-10-15 02:56:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:56:12,039 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-15 02:56:12,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 02:56:12,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-15 02:56:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:56:12,043 INFO L225 Difference]: With dead ends: 37 [2019-10-15 02:56:12,043 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 02:56:12,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-15 02:56:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 02:56:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-15 02:56:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 02:56:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-15 02:56:12,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2019-10-15 02:56:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:56:12,066 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-15 02:56:12,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:56:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-15 02:56:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 02:56:12,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:56:12,068 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:56:12,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:56:12,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:56:12,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1298848610, now seen corresponding path program 1 times [2019-10-15 02:56:12,069 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:56:12,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836929699] [2019-10-15 02:56:12,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:12,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:12,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:56:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:56:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 02:56:12,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836929699] [2019-10-15 02:56:12,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893253419] [2019-10-15 02:56:12,802 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 [2019-10-15 02:56:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:56:12,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 93 conjunts are in the unsatisfiable core [2019-10-15 02:56:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:56:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:56:14,128 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:56:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:56:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:56:16,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:56:16,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:56:16,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:56:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:56:16,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [670194726] [2019-10-15 02:56:16,374 INFO L162 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-10-15 02:56:16,375 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:56:16,379 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:56:16,385 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:56:16,386 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:56:16,657 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 61 for LOIs [2019-10-15 02:56:19,359 INFO L199 IcfgInterpreter]: Interpreting procedure list_add with input of size 17 for LOIs [2019-10-15 02:56:19,389 INFO L199 IcfgInterpreter]: Interpreting procedure __blast_assert with input of size 14 for LOIs [2019-10-15 02:56:19,394 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 31 for LOIs [2019-10-15 02:56:19,404 INFO L199 IcfgInterpreter]: Interpreting procedure my_malloc with input of size 62 for LOIs [2019-10-15 02:56:19,533 INFO L199 IcfgInterpreter]: Interpreting procedure __getMemory with input of size 59 for LOIs [2019-10-15 02:56:19,607 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 02:56:19,966 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-15 02:56:20,196 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-10-15 02:56:20,506 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-10-15 02:56:20,781 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-15 02:56:21,107 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-10-15 02:56:21,506 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-15 02:56:21,824 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-10-15 02:56:22,414 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-10-15 02:56:22,927 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-15 02:56:23,458 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-10-15 02:56:23,956 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-10-15 02:56:24,580 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-10-15 02:56:25,188 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-15 02:56:25,702 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-10-15 02:56:26,329 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-10-15 02:56:26,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 02:56:26,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21, 22] total 79 [2019-10-15 02:56:26,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400122801] [2019-10-15 02:56:26,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-15 02:56:26,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:56:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-15 02:56:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=5801, Unknown=0, NotChecked=0, Total=6162 [2019-10-15 02:56:26,606 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 79 states. [2019-10-15 02:56:27,063 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-10-15 02:56:27,480 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-15 02:56:27,803 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-10-15 02:56:28,124 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-10-15 02:56:28,450 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-10-15 02:56:28,921 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-15 02:56:29,276 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2019-10-15 02:56:29,665 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-10-15 02:56:30,144 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-15 02:56:30,485 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-10-15 02:56:30,765 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 68 [2019-10-15 02:56:31,014 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2019-10-15 02:56:31,240 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-15 02:56:31,523 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2019-10-15 02:56:31,890 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-10-15 02:56:32,233 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-15 02:56:32,522 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-10-15 02:56:33,160 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-10-15 02:56:33,787 WARN L191 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-10-15 02:56:34,239 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-10-15 02:56:34,467 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-10-15 02:56:34,662 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 02:56:34,980 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-15 02:56:35,332 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-10-15 02:56:35,756 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-10-15 02:56:36,683 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-15 02:56:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:56:36,910 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-10-15 02:56:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-15 02:56:36,915 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 36 [2019-10-15 02:56:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:56:36,916 INFO L225 Difference]: With dead ends: 48 [2019-10-15 02:56:36,916 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 02:56:36,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3437 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1102, Invalid=11554, Unknown=0, NotChecked=0, Total=12656 [2019-10-15 02:56:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 02:56:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-10-15 02:56:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 02:56:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-10-15 02:56:36,933 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-10-15 02:56:36,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:56:36,934 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-10-15 02:56:36,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-15 02:56:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-10-15 02:56:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 02:56:36,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:56:36,935 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:56:37,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:56:37,137 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:56:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:56:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1231387513, now seen corresponding path program 1 times [2019-10-15 02:56:37,138 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:56:37,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309444230] [2019-10-15 02:56:37,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:37,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:56:37,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:56:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:56:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 02:56:37,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309444230] [2019-10-15 02:56:37,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:56:37,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 02:56:37,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429882482] [2019-10-15 02:56:37,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 02:56:37,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:56:37,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 02:56:37,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:56:37,260 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 7 states. [2019-10-15 02:56:37,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:56:37,361 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-10-15 02:56:37,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 02:56:37,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-15 02:56:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:56:37,362 INFO L225 Difference]: With dead ends: 41 [2019-10-15 02:56:37,362 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 02:56:37,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 02:56:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 02:56:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 02:56:37,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 02:56:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 02:56:37,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-10-15 02:56:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:56:37,364 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 02:56:37,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 02:56:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 02:56:37,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 02:56:37,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 02:56:37,761 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-10-15 02:56:38,009 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2019-10-15 02:56:38,260 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-10-15 02:56:38,503 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70 [2019-10-15 02:56:38,674 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-10-15 02:56:38,947 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2019-10-15 02:56:39,172 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-10-15 02:56:39,369 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-15 02:56:39,602 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2019-10-15 02:56:39,765 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-10-15 02:56:40,017 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-10-15 02:56:40,023 INFO L439 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= |my_malloc_#in~size| 8)) (not (= 1 (select |#valid| |~#head~0.base|))) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= my_malloc_~size 8)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-10-15 02:56:40,023 INFO L443 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2019-10-15 02:56:40,024 INFO L439 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= |my_malloc_#in~size| 8)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-10-15 02:56:40,024 INFO L443 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2019-10-15 02:56:40,024 INFO L439 ceAbstractionStarter]: 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|) (= |old(~elem~0.offset)| ~elem~0.offset) (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |old(~elem~0.base)| ~elem~0.base) (= |~#head~0.offset| |old(~#head~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) [2019-10-15 02:56:40,024 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:56:40,024 INFO L443 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2019-10-15 02:56:40,024 INFO L439 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base))) [2019-10-15 02:56:40,025 INFO L439 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (= |old(~elem~0.offset)| |list_add_#in~new.offset|) (= |old(~elem~0.base)| |list_add_#in~new.base|)) (and (= |old(~elem~0.offset)| ~elem~0.offset) (= |old(~elem~0.base)| ~elem~0.base)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (not (<= 0 |list_add_#in~head.offset|)) (not (<= |list_add_#in~head.offset| 0))) [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-15 02:56:40,025 INFO L439 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (= |old(~elem~0.offset)| |list_add_#in~new.offset|) (= |old(~elem~0.base)| |list_add_#in~new.base|)) (not (<= 0 |#NULL.base|)) (not (= 0 |~#head~0.offset|)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (not (<= 0 |list_add_#in~head.offset|)) (not (<= |list_add_#in~head.offset| 0))) [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2019-10-15 02:56:40,025 INFO L446 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2019-10-15 02:56:40,025 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 02:56:40,026 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse1 (+ |~#head~0.offset| 4))) (and (<= |#NULL.base| 0) (< |~#head~0.base| |#StackHeapBarrier|) (= 0 (select .cse0 .cse1)) (<= 0 |#NULL.base|) (= 8 (select |#length| |~#head~0.base|)) (= (select .cse0 |~#head~0.offset|) 0) (<= 0 |~#head~0.offset|) (= 0 ~guard_malloc_counter~0.offset) (= 0 (select .cse2 |~#head~0.offset|)) (= ~elem~0.base 0) (= 0 (select |#valid| 0)) (<= |~#head~0.offset| 0) (= 0 ~guard_malloc_counter~0.base) (= |#NULL.offset| 0) (= 0 (select .cse2 .cse1)) (= ~elem~0.offset 0) (= 1 (select |#valid| |~#head~0.base|)))) [2019-10-15 02:56:40,026 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 02:56:40,026 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 02:56:40,026 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (and (<= ~guard_malloc_counter~0.offset 0) (<= 0 ~elem~0.offset) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.base 0) (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,026 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2019-10-15 02:56:40,026 INFO L439 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (and (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (or (not (= main_~dev2~0.base ~elem~0.base)) (not (= main_~dev2~0.offset ~elem~0.offset))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0))) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,027 INFO L439 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (and (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,027 INFO L439 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (and (= main_~dev2~0.offset ~guard_malloc_counter~0.offset) (not (= main_~dev1~0.offset 0)) (= ~elem~0.offset 0) (and (= 0 main_~dev1~0.base) (<= (+ main_~dev1~0.offset 1) main_~dev2~0.offset)) (= main_~dev2~0.base ~guard_malloc_counter~0.base) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (not (= main_~dev2~0.offset ~elem~0.offset)) (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.base 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,027 INFO L443 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2019-10-15 02:56:40,027 INFO L439 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (let ((.cse3 (= ~elem~0.offset 0))) (and (<= main_~dev1~0.offset ~guard_malloc_counter~0.offset) (or (not (= main_~dev2~0.base 0)) (not (= main_~dev2~0.offset 0))) (or (and (not .cse3) (= ~elem~0.base |old(~guard_malloc_counter~0.base)|)) (= 0 ~guard_malloc_counter~0.base)) (not (= main_~dev1~0.offset 0)) (let ((.cse4 (= 0 main_~dev1~0.base))) (or (and .cse4 (<= (+ main_~dev1~0.offset 1) ~elem~0.offset)) (and .cse4 .cse3))) (< 0 (+ ~guard_malloc_counter~0.offset 2)) (not (= (+ ~guard_malloc_counter~0.offset 1) 0)) (not (= main_~dev2~0.offset main_~dev1~0.offset)))) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,027 INFO L439 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse3 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (and (= ~elem~0.offset 0) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (= ~elem~0.base 0) (let ((.cse1 (= 0 main_~dev1~0.base))) (or (and .cse1 (= main_~dev1~0.offset ~guard_malloc_counter~0.offset)) (and .cse1 (= main_~dev1~0.offset 0))))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse2 .cse3))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse2 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse3) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,027 INFO L443 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2019-10-15 02:56:40,028 INFO L439 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= 0 |old(~guard_malloc_counter~0.offset)|)) (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (<= 0 |old(~elem~0.base)|)) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (<= |old(~guard_malloc_counter~0.base)| 0)) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= |old(~elem~0.offset)| 0)) (not (= (select .cse0 .cse2) 0)) (and (<= ~guard_malloc_counter~0.offset 0) (<= 0 ~elem~0.offset) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|) (= ~elem~0.base 0) (<= 0 ~guard_malloc_counter~0.offset) (<= ~elem~0.offset 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 |old(~elem~0.offset)|)) (not (<= |old(~elem~0.base)| 0)) (not (<= 0 |old(~guard_malloc_counter~0.base)|)) (not (< |~#head~0.base| |#StackHeapBarrier|)) (not (<= |old(~guard_malloc_counter~0.offset)| 0)))) [2019-10-15 02:56:40,028 INFO L443 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2019-10-15 02:56:40,028 INFO L443 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2019-10-15 02:56:40,028 INFO L439 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |__getMemory_#in~size| 8)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (and (= ~guard_malloc_counter~0.offset |old(~guard_malloc_counter~0.offset)|) (= ~guard_malloc_counter~0.base |old(~guard_malloc_counter~0.base)|)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-10-15 02:56:40,028 INFO L443 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2019-10-15 02:56:40,028 INFO L443 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-10-15 02:56:40,028 INFO L439 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#head~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#head~0.base|)) (.cse2 (+ |~#head~0.offset| 4))) (or (not (<= |~#head~0.offset| 0)) (not (= 8 (select |#length| |~#head~0.base|))) (not (= (select .cse0 |~#head~0.offset|) 0)) (not (= 0 |old(~guard_malloc_counter~0.base)|)) (not (= |__getMemory_#in~size| 8)) (not (= ~elem~0.base 0)) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 0 (select .cse1 .cse2))) (not (= 0 (select .cse1 |~#head~0.offset|))) (not (= 1 (select |#valid| |~#head~0.base|))) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (<= ~elem~0.offset 0)) (not (= (select .cse0 .cse2) 0)) (not (<= 0 |~#head~0.offset|)) (not (<= 0 ~elem~0.offset)) (not (< |~#head~0.base| |#StackHeapBarrier|)))) [2019-10-15 02:56:40,028 INFO L443 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2019-10-15 02:56:40,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:56:40 BoogieIcfgContainer [2019-10-15 02:56:40,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 02:56:40,035 INFO L168 Benchmark]: Toolchain (without parser) took 30297.61 ms. Allocated memory was 138.4 MB in the beginning and 549.5 MB in the end (delta: 411.0 MB). Free memory was 100.5 MB in the beginning and 497.7 MB in the end (delta: -397.2 MB). Peak memory consumption was 429.5 MB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,035 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.46 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 165.3 MB in the end (delta: -65.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,037 INFO L168 Benchmark]: Boogie Preprocessor took 64.29 ms. Allocated memory is still 201.9 MB. Free memory was 165.3 MB in the beginning and 162.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,037 INFO L168 Benchmark]: RCFGBuilder took 671.91 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 110.8 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,038 INFO L168 Benchmark]: TraceAbstraction took 28940.43 ms. Allocated memory was 201.9 MB in the beginning and 549.5 MB in the end (delta: 347.6 MB). Free memory was 110.2 MB in the beginning and 497.7 MB in the end (delta: -387.5 MB). Peak memory consumption was 375.7 MB. Max. memory is 7.1 GB. [2019-10-15 02:56:40,041 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 616.46 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 165.3 MB in the end (delta: -65.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.29 ms. Allocated memory is still 201.9 MB. Free memory was 165.3 MB in the beginning and 162.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 671.91 ms. Allocated memory is still 201.9 MB. Free memory was 162.0 MB in the beginning and 110.8 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28940.43 ms. Allocated memory was 201.9 MB in the beginning and 549.5 MB in the end (delta: 347.6 MB). Free memory was 110.2 MB in the beginning and 497.7 MB in the end (delta: -387.5 MB). Peak memory consumption was 375.7 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 8 procedures, 37 locations, 1 error locations. Result: SAFE, OverallTime: 28.8s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 103 SDtfs, 157 SDslu, 338 SDs, 0 SdLazy, 1603 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 193 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3441 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 41 PreInvPairs, 46 NumberOfFragments, 1629 HoareAnnotationTreeSize, 41 FomulaSimplifications, 76 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2269 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 56057 SizeOfPredicates, 22 NumberOfNonLiveVariables, 245 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 29/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 3232, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 81, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 38, TOOLS_POST_TIME[ms]: 140, TOOLS_POST_CALL_APPLICATIONS: 32, TOOLS_POST_CALL_TIME[ms]: 82, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME[ms]: 69, TOOLS_QUANTIFIERELIM_APPLICATIONS: 94, TOOLS_QUANTIFIERELIM_TIME[ms]: 245, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 109, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 81, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 81, DOMAIN_JOIN_TIME[ms]: 2815, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 39, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 24, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME[ms]: 195, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 194, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 5, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 23, DAG_COMPRESSION_PROCESSED_NODES: 193, DAG_COMPRESSION_RETAINED_NODES: 117, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...