java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list_search_true-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:22:16,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:22:16,932 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:22:16,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:22:16,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:22:16,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:22:16,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:22:16,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:22:16,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:22:16,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:22:16,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:22:16,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:22:16,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:22:16,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:22:16,966 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:22:16,967 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:22:16,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:22:16,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:22:16,971 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:22:16,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:22:16,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:22:16,975 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:22:16,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:22:16,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:22:16,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:22:16,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:22:16,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:22:16,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:22:16,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:22:16,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:22:16,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:22:16,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:22:16,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:22:16,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:22:16,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:22:16,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:22:16,986 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:22:17,002 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:22:17,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:22:17,003 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:22:17,003 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:22:17,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:22:17,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:22:17,006 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:22:17,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:22:17,007 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:22:17,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:22:17,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:22:17,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:22:17,009 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:22:17,009 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:22:17,009 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:22:17,009 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:22:17,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:22:17,010 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:22:17,010 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:22:17,010 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:22:17,010 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:22:17,011 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:22:17,011 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:22:17,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:22:17,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:22:17,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:22:17,012 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:22:17,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:22:17,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:22:17,014 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:22:17,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:22:17,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:22:17,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:22:17,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:22:17,085 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:22:17,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:17,156 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ade8f89/f5cb3dda2e16435083eb1aa9e88e991d/FLAG6fe3d28de [2018-11-14 17:22:17,768 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:22:17,769 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:17,785 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ade8f89/f5cb3dda2e16435083eb1aa9e88e991d/FLAG6fe3d28de [2018-11-14 17:22:17,803 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ade8f89/f5cb3dda2e16435083eb1aa9e88e991d [2018-11-14 17:22:17,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:22:17,815 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:22:17,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:17,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:22:17,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:22:17,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:17" (1/1) ... [2018-11-14 17:22:17,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f9f56a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:17, skipping insertion in model container [2018-11-14 17:22:17,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:22:17" (1/1) ... [2018-11-14 17:22:17,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:22:17,909 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:22:18,523 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:18,535 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:22:18,622 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:22:18,861 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:22:18,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18 WrapperNode [2018-11-14 17:22:18,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:22:18,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:22:18,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:22:18,863 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:22:18,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:18,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (1/1) ... [2018-11-14 17:22:19,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:22:19,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:22:19,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:22:19,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:22:19,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (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 [2018-11-14 17:22:19,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_list [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-14 17:22:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2018-11-14 17:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2018-11-14 17:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2018-11-14 17:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2018-11-14 17:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2018-11-14 17:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2018-11-14 17:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2018-11-14 17:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2018-11-14 17:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2018-11-14 17:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2018-11-14 17:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2018-11-14 17:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2018-11-14 17:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2018-11-14 17:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2018-11-14 17:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2018-11-14 17:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2018-11-14 17:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2018-11-14 17:22:19,073 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2018-11-14 17:22:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2018-11-14 17:22:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2018-11-14 17:22:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2018-11-14 17:22:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2018-11-14 17:22:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2018-11-14 17:22:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2018-11-14 17:22:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2018-11-14 17:22:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2018-11-14 17:22:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2018-11-14 17:22:19,075 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2018-11-14 17:22:19,076 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2018-11-14 17:22:19,077 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2018-11-14 17:22:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2018-11-14 17:22:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2018-11-14 17:22:19,080 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2018-11-14 17:22:19,081 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2018-11-14 17:22:19,081 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2018-11-14 17:22:19,081 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2018-11-14 17:22:19,081 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2018-11-14 17:22:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2018-11-14 17:22:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2018-11-14 17:22:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-14 17:22:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2018-11-14 17:22:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2018-11-14 17:22:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2018-11-14 17:22:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2018-11-14 17:22:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2018-11-14 17:22:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2018-11-14 17:22:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2018-11-14 17:22:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2018-11-14 17:22:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2018-11-14 17:22:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2018-11-14 17:22:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2018-11-14 17:22:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2018-11-14 17:22:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2018-11-14 17:22:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2018-11-14 17:22:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2018-11-14 17:22:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2018-11-14 17:22:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2018-11-14 17:22:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2018-11-14 17:22:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2018-11-14 17:22:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2018-11-14 17:22:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2018-11-14 17:22:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:22:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:22:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:22:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:22:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:22:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:22:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:22:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:22:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:22:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:22:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:22:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:22:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:22:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:22:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:22:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:22:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:22:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:22:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:22:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:22:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:22:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:22:19,105 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:22:19,106 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:22:19,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure delete_list [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:22:19,108 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:22:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:22:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:22:19,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:22:20,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:22:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:20 BoogieIcfgContainer [2018-11-14 17:22:20,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:22:20,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:22:20,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:22:20,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:22:20,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:22:17" (1/3) ... [2018-11-14 17:22:20,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cab7efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:20, skipping insertion in model container [2018-11-14 17:22:20,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:22:18" (2/3) ... [2018-11-14 17:22:20,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cab7efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:22:20, skipping insertion in model container [2018-11-14 17:22:20,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:22:20" (3/3) ... [2018-11-14 17:22:20,787 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-14 17:22:20,797 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:22:20,806 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:22:20,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:22:20,856 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:22:20,856 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:22:20,857 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:22:20,857 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:22:20,857 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:22:20,857 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:22:20,857 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:22:20,857 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:22:20,857 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:22:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-14 17:22:20,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 17:22:20,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:20,887 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:20,890 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:20,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:20,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2134390212, now seen corresponding path program 1 times [2018-11-14 17:22:20,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:20,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:21,418 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 17:22:21,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {59#true} is VALID [2018-11-14 17:22:21,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:21,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #129#return; {59#true} is VALID [2018-11-14 17:22:21,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret45 := main(); {59#true} is VALID [2018-11-14 17:22:21,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {59#true} is VALID [2018-11-14 17:22:21,423 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {59#true} is VALID [2018-11-14 17:22:21,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {61#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:21,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {61#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:21,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {62#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:21,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {62#(not (= 0 ~head~0.base))} assume true; {62#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:21,449 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {62#(not (= 0 ~head~0.base))} {59#true} #115#return; {62#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:21,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {62#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {62#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:21,459 INFO L256 TraceCheckUtils]: 13: Hoare triple {62#(not (= 0 ~head~0.base))} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {63#(= |old(~head~0.base)| ~head~0.base)} is VALID [2018-11-14 17:22:21,460 INFO L273 TraceCheckUtils]: 14: Hoare triple {63#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {63#(= |old(~head~0.base)| ~head~0.base)} is VALID [2018-11-14 17:22:21,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {63#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {64#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:21,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {64#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {64#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:21,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {64#(= 0 |old(~head~0.base)|)} assume true; {64#(= 0 |old(~head~0.base)|)} is VALID [2018-11-14 17:22:21,471 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {64#(= 0 |old(~head~0.base)|)} {62#(not (= 0 ~head~0.base))} #117#return; {60#false} is VALID [2018-11-14 17:22:21,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {60#false} is VALID [2018-11-14 17:22:21,472 INFO L256 TraceCheckUtils]: 20: Hoare triple {60#false} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {59#true} is VALID [2018-11-14 17:22:21,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:21,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:21,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:21,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:21,474 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {59#true} {60#false} #119#return; {60#false} is VALID [2018-11-14 17:22:21,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {60#false} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {60#false} is VALID [2018-11-14 17:22:21,474 INFO L256 TraceCheckUtils]: 27: Hoare triple {60#false} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {59#true} is VALID [2018-11-14 17:22:21,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:21,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:21,475 INFO L273 TraceCheckUtils]: 30: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:21,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:21,476 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {59#true} {60#false} #121#return; {60#false} is VALID [2018-11-14 17:22:21,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {60#false} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {60#false} is VALID [2018-11-14 17:22:21,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:22:21,477 INFO L256 TraceCheckUtils]: 35: Hoare triple {60#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {59#true} is VALID [2018-11-14 17:22:21,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {59#true} is VALID [2018-11-14 17:22:21,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {59#true} assume !true; {59#true} is VALID [2018-11-14 17:22:21,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {59#true} #res.base, #res.offset := ~l.base, ~l.offset; {59#true} is VALID [2018-11-14 17:22:21,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:21,478 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {59#true} {60#false} #123#return; {60#false} is VALID [2018-11-14 17:22:21,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {60#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {60#false} is VALID [2018-11-14 17:22:21,479 INFO L256 TraceCheckUtils]: 42: Hoare triple {60#false} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {60#false} is VALID [2018-11-14 17:22:21,479 INFO L273 TraceCheckUtils]: 43: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2018-11-14 17:22:21,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {60#false} assume ~cond == 0; {60#false} is VALID [2018-11-14 17:22:21,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 17:22:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:22:21,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:21,492 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:21,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:21,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:22,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 17:22:22,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {59#true} is VALID [2018-11-14 17:22:22,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:22,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #129#return; {59#true} is VALID [2018-11-14 17:22:22,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret45 := main(); {59#true} is VALID [2018-11-14 17:22:22,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {59#true} is VALID [2018-11-14 17:22:22,077 INFO L256 TraceCheckUtils]: 6: Hoare triple {59#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {59#true} is VALID [2018-11-14 17:22:22,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:22,078 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:22,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:22,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:22,079 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {59#true} {59#true} #115#return; {59#true} is VALID [2018-11-14 17:22:22,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {59#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {59#true} is VALID [2018-11-14 17:22:22,079 INFO L256 TraceCheckUtils]: 13: Hoare triple {59#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {59#true} is VALID [2018-11-14 17:22:22,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:22,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:22,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:22,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:22,081 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {59#true} {59#true} #117#return; {59#true} is VALID [2018-11-14 17:22:22,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {59#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {59#true} is VALID [2018-11-14 17:22:22,082 INFO L256 TraceCheckUtils]: 20: Hoare triple {59#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {59#true} is VALID [2018-11-14 17:22:22,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:22,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:22,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:22,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:22,083 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {59#true} {59#true} #119#return; {59#true} is VALID [2018-11-14 17:22:22,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {59#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {59#true} is VALID [2018-11-14 17:22:22,083 INFO L256 TraceCheckUtils]: 27: Hoare triple {59#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {59#true} is VALID [2018-11-14 17:22:22,084 INFO L273 TraceCheckUtils]: 28: Hoare triple {59#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#true} is VALID [2018-11-14 17:22:22,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {59#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {59#true} is VALID [2018-11-14 17:22:22,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {59#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {59#true} is VALID [2018-11-14 17:22:22,084 INFO L273 TraceCheckUtils]: 31: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 17:22:22,085 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {59#true} {59#true} #121#return; {59#true} is VALID [2018-11-14 17:22:22,085 INFO L273 TraceCheckUtils]: 33: Hoare triple {59#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {59#true} is VALID [2018-11-14 17:22:22,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-14 17:22:22,086 INFO L256 TraceCheckUtils]: 35: Hoare triple {60#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {60#false} is VALID [2018-11-14 17:22:22,086 INFO L273 TraceCheckUtils]: 36: Hoare triple {60#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {60#false} is VALID [2018-11-14 17:22:22,086 INFO L273 TraceCheckUtils]: 37: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 17:22:22,087 INFO L273 TraceCheckUtils]: 38: Hoare triple {60#false} #res.base, #res.offset := ~l.base, ~l.offset; {60#false} is VALID [2018-11-14 17:22:22,087 INFO L273 TraceCheckUtils]: 39: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 17:22:22,087 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {60#false} {60#false} #123#return; {60#false} is VALID [2018-11-14 17:22:22,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {60#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {60#false} is VALID [2018-11-14 17:22:22,088 INFO L256 TraceCheckUtils]: 42: Hoare triple {60#false} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {60#false} is VALID [2018-11-14 17:22:22,088 INFO L273 TraceCheckUtils]: 43: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2018-11-14 17:22:22,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {60#false} assume ~cond == 0; {60#false} is VALID [2018-11-14 17:22:22,089 INFO L273 TraceCheckUtils]: 45: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 17:22:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 17:22:22,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:22:22,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-14 17:22:22,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-14 17:22:22,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:22,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:22:22,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:22,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:22:22,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:22:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:22:22,440 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 6 states. [2018-11-14 17:22:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:23,788 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2018-11-14 17:22:23,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:22:23,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-14 17:22:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-14 17:22:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:22:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-14 17:22:23,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 199 transitions. [2018-11-14 17:22:24,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:24,338 INFO L225 Difference]: With dead ends: 146 [2018-11-14 17:22:24,338 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:22:24,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:22:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:22:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2018-11-14 17:22:24,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:24,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 41 states. [2018-11-14 17:22:24,429 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 41 states. [2018-11-14 17:22:24,429 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 41 states. [2018-11-14 17:22:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:24,437 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 17:22:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 17:22:24,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:24,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:24,439 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 54 states. [2018-11-14 17:22:24,439 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 54 states. [2018-11-14 17:22:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:24,446 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-14 17:22:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 17:22:24,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:24,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:24,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:24,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:22:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-14 17:22:24,453 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 46 [2018-11-14 17:22:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:24,454 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-14 17:22:24,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:22:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 17:22:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 17:22:24,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:24,457 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:24,457 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:24,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:24,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1408052899, now seen corresponding path program 1 times [2018-11-14 17:22:24,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:24,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:24,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2018-11-14 17:22:24,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {574#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {574#true} is VALID [2018-11-14 17:22:24,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #129#return; {574#true} is VALID [2018-11-14 17:22:24,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret45 := main(); {574#true} is VALID [2018-11-14 17:22:24,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {574#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {574#true} is VALID [2018-11-14 17:22:24,656 INFO L256 TraceCheckUtils]: 6: Hoare triple {574#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {574#true} is VALID [2018-11-14 17:22:24,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {574#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {574#true} is VALID [2018-11-14 17:22:24,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {574#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {574#true} is VALID [2018-11-14 17:22:24,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {574#true} is VALID [2018-11-14 17:22:24,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,660 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {574#true} {574#true} #115#return; {574#true} is VALID [2018-11-14 17:22:24,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {574#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {574#true} is VALID [2018-11-14 17:22:24,660 INFO L256 TraceCheckUtils]: 13: Hoare triple {574#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {574#true} is VALID [2018-11-14 17:22:24,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {574#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {574#true} is VALID [2018-11-14 17:22:24,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {574#true} is VALID [2018-11-14 17:22:24,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {574#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {574#true} is VALID [2018-11-14 17:22:24,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,662 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {574#true} {574#true} #117#return; {574#true} is VALID [2018-11-14 17:22:24,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {574#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {574#true} is VALID [2018-11-14 17:22:24,666 INFO L256 TraceCheckUtils]: 20: Hoare triple {574#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {574#true} is VALID [2018-11-14 17:22:24,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {574#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {574#true} is VALID [2018-11-14 17:22:24,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {574#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {574#true} is VALID [2018-11-14 17:22:24,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {574#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {574#true} is VALID [2018-11-14 17:22:24,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,667 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {574#true} {574#true} #119#return; {574#true} is VALID [2018-11-14 17:22:24,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {574#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {574#true} is VALID [2018-11-14 17:22:24,671 INFO L256 TraceCheckUtils]: 27: Hoare triple {574#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {574#true} is VALID [2018-11-14 17:22:24,673 INFO L273 TraceCheckUtils]: 28: Hoare triple {574#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {576#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:24,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {576#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {576#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:24,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {576#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {577#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:24,695 INFO L273 TraceCheckUtils]: 31: Hoare triple {577#(not (= 0 ~head~0.base))} assume true; {577#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:24,697 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {577#(not (= 0 ~head~0.base))} {574#true} #121#return; {577#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:24,697 INFO L273 TraceCheckUtils]: 33: Hoare triple {577#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {578#(not (= 0 main_~mylist~0.base))} is VALID [2018-11-14 17:22:24,698 INFO L273 TraceCheckUtils]: 34: Hoare triple {578#(not (= 0 main_~mylist~0.base))} assume true; {578#(not (= 0 main_~mylist~0.base))} is VALID [2018-11-14 17:22:24,699 INFO L273 TraceCheckUtils]: 35: Hoare triple {578#(not (= 0 main_~mylist~0.base))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {575#false} is VALID [2018-11-14 17:22:24,699 INFO L256 TraceCheckUtils]: 36: Hoare triple {575#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {574#true} is VALID [2018-11-14 17:22:24,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {574#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {574#true} is VALID [2018-11-14 17:22:24,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,700 INFO L273 TraceCheckUtils]: 39: Hoare triple {574#true} #t~short29 := ~l.base != 0 || ~l.offset != 0; {574#true} is VALID [2018-11-14 17:22:24,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {574#true} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {574#true} is VALID [2018-11-14 17:22:24,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {574#true} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {574#true} is VALID [2018-11-14 17:22:24,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#true} #res.base, #res.offset := ~l.base, ~l.offset; {574#true} is VALID [2018-11-14 17:22:24,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#true} assume true; {574#true} is VALID [2018-11-14 17:22:24,703 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {574#true} {575#false} #123#return; {575#false} is VALID [2018-11-14 17:22:24,703 INFO L273 TraceCheckUtils]: 45: Hoare triple {575#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {575#false} is VALID [2018-11-14 17:22:24,703 INFO L256 TraceCheckUtils]: 46: Hoare triple {575#false} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {575#false} is VALID [2018-11-14 17:22:24,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2018-11-14 17:22:24,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {575#false} assume ~cond == 0; {575#false} is VALID [2018-11-14 17:22:24,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {575#false} assume !false; {575#false} is VALID [2018-11-14 17:22:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:22:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:24,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:22:24,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-14 17:22:24,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:24,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:22:24,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:24,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:22:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:22:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:22:24,802 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2018-11-14 17:22:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:25,178 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-14 17:22:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:22:25,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-14 17:22:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 17:22:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:22:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2018-11-14 17:22:25,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2018-11-14 17:22:25,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:25,291 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:22:25,292 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:22:25,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:22:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-14 17:22:25,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:25,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:25,337 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:25,337 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-14 17:22:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:25,341 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 17:22:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 17:22:25,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:25,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:25,343 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-14 17:22:25,343 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-14 17:22:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:25,347 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-14 17:22:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 17:22:25,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:25,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:25,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:25,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:22:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-14 17:22:25,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 50 [2018-11-14 17:22:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:25,352 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-14 17:22:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:22:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-14 17:22:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:22:25,355 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:25,355 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:25,355 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:25,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -81208029, now seen corresponding path program 1 times [2018-11-14 17:22:25,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:25,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:25,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {814#true} call ULTIMATE.init(); {814#true} is VALID [2018-11-14 17:22:25,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {814#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {814#true} is VALID [2018-11-14 17:22:25,953 INFO L273 TraceCheckUtils]: 2: Hoare triple {814#true} assume true; {814#true} is VALID [2018-11-14 17:22:25,953 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {814#true} {814#true} #129#return; {814#true} is VALID [2018-11-14 17:22:25,953 INFO L256 TraceCheckUtils]: 4: Hoare triple {814#true} call #t~ret45 := main(); {814#true} is VALID [2018-11-14 17:22:25,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {814#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {814#true} is VALID [2018-11-14 17:22:25,953 INFO L256 TraceCheckUtils]: 6: Hoare triple {814#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {814#true} is VALID [2018-11-14 17:22:25,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {814#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {814#true} is VALID [2018-11-14 17:22:25,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {814#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {814#true} is VALID [2018-11-14 17:22:25,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {814#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {814#true} is VALID [2018-11-14 17:22:25,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {814#true} assume true; {814#true} is VALID [2018-11-14 17:22:25,954 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {814#true} {814#true} #115#return; {814#true} is VALID [2018-11-14 17:22:25,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {814#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {814#true} is VALID [2018-11-14 17:22:25,955 INFO L256 TraceCheckUtils]: 13: Hoare triple {814#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {814#true} is VALID [2018-11-14 17:22:25,955 INFO L273 TraceCheckUtils]: 14: Hoare triple {814#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {814#true} is VALID [2018-11-14 17:22:25,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {814#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {814#true} is VALID [2018-11-14 17:22:25,956 INFO L273 TraceCheckUtils]: 16: Hoare triple {814#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {814#true} is VALID [2018-11-14 17:22:25,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {814#true} assume true; {814#true} is VALID [2018-11-14 17:22:25,956 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {814#true} {814#true} #117#return; {814#true} is VALID [2018-11-14 17:22:25,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {814#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {814#true} is VALID [2018-11-14 17:22:25,957 INFO L256 TraceCheckUtils]: 20: Hoare triple {814#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {814#true} is VALID [2018-11-14 17:22:25,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {814#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {814#true} is VALID [2018-11-14 17:22:25,957 INFO L273 TraceCheckUtils]: 22: Hoare triple {814#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {814#true} is VALID [2018-11-14 17:22:25,958 INFO L273 TraceCheckUtils]: 23: Hoare triple {814#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {814#true} is VALID [2018-11-14 17:22:25,958 INFO L273 TraceCheckUtils]: 24: Hoare triple {814#true} assume true; {814#true} is VALID [2018-11-14 17:22:25,958 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {814#true} {814#true} #119#return; {814#true} is VALID [2018-11-14 17:22:25,958 INFO L273 TraceCheckUtils]: 26: Hoare triple {814#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {814#true} is VALID [2018-11-14 17:22:25,958 INFO L256 TraceCheckUtils]: 27: Hoare triple {814#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {814#true} is VALID [2018-11-14 17:22:25,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {814#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {816#(<= |insert_list_#in~k| insert_list_~k)} is VALID [2018-11-14 17:22:25,962 INFO L273 TraceCheckUtils]: 29: Hoare triple {816#(<= |insert_list_#in~k| insert_list_~k)} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {817#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} is VALID [2018-11-14 17:22:25,962 INFO L273 TraceCheckUtils]: 30: Hoare triple {817#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {818#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {818#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {818#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,965 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} {814#true} #121#return; {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,966 INFO L273 TraceCheckUtils]: 34: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,968 INFO L273 TraceCheckUtils]: 35: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, ~mylist~0.offset + 4, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,975 INFO L273 TraceCheckUtils]: 37: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-14 17:22:25,975 INFO L256 TraceCheckUtils]: 38: Hoare triple {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {814#true} is VALID [2018-11-14 17:22:25,976 INFO L273 TraceCheckUtils]: 39: Hoare triple {814#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:25,976 INFO L273 TraceCheckUtils]: 40: Hoare triple {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} assume true; {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:25,977 INFO L273 TraceCheckUtils]: 41: Hoare triple {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:25,977 INFO L273 TraceCheckUtils]: 42: Hoare triple {820#(and (= search_list_~l.base ~head~0.base) (<= search_list_~k |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {821#(or |search_list_#t~short29| (and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset)))} is VALID [2018-11-14 17:22:25,978 INFO L273 TraceCheckUtils]: 43: Hoare triple {821#(or |search_list_#t~short29| (and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset)))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {822#(and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-14 17:22:25,979 INFO L273 TraceCheckUtils]: 44: Hoare triple {822#(and (= search_list_~l.base ~head~0.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} #res.base, #res.offset := ~l.base, ~l.offset; {823#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:25,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {823#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} assume true; {823#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:25,982 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {823#(<= (select (select |#memory_int| ~head~0.base) ~head~0.offset) |search_list_#in~k|)} {819#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} #123#return; {815#false} is VALID [2018-11-14 17:22:25,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {815#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {815#false} is VALID [2018-11-14 17:22:25,982 INFO L256 TraceCheckUtils]: 48: Hoare triple {815#false} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {815#false} is VALID [2018-11-14 17:22:25,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {815#false} ~cond := #in~cond; {815#false} is VALID [2018-11-14 17:22:25,983 INFO L273 TraceCheckUtils]: 50: Hoare triple {815#false} assume ~cond == 0; {815#false} is VALID [2018-11-14 17:22:25,983 INFO L273 TraceCheckUtils]: 51: Hoare triple {815#false} assume !false; {815#false} is VALID [2018-11-14 17:22:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 17:22:25,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:25,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 17:22:25,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-14 17:22:25,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:25,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:22:26,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:26,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:22:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:22:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:22:26,088 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 10 states. [2018-11-14 17:22:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:27,411 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:22:27,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:22:27,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-11-14 17:22:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-14 17:22:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:22:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2018-11-14 17:22:27,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2018-11-14 17:22:27,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:27,658 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:22:27,658 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:22:27,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:22:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:22:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-11-14 17:22:27,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:27,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 47 states. [2018-11-14 17:22:27,715 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 47 states. [2018-11-14 17:22:27,715 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 47 states. [2018-11-14 17:22:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:27,720 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:22:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:22:27,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:27,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:27,721 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 54 states. [2018-11-14 17:22:27,721 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 54 states. [2018-11-14 17:22:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:27,725 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:22:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:22:27,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:27,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:27,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:27,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:22:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-14 17:22:27,730 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 52 [2018-11-14 17:22:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:27,730 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-14 17:22:27,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:22:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-14 17:22:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:22:27,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:27,732 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:27,733 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:27,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash -474235039, now seen corresponding path program 1 times [2018-11-14 17:22:27,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:27,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:27,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:27,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:28,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1097#true} is VALID [2018-11-14 17:22:28,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {1097#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1097#true} is VALID [2018-11-14 17:22:28,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-14 17:22:28,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #129#return; {1097#true} is VALID [2018-11-14 17:22:28,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {1097#true} call #t~ret45 := main(); {1097#true} is VALID [2018-11-14 17:22:28,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {1097#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1097#true} is VALID [2018-11-14 17:22:28,423 INFO L256 TraceCheckUtils]: 6: Hoare triple {1097#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1097#true} is VALID [2018-11-14 17:22:28,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {1097#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1097#true} is VALID [2018-11-14 17:22:28,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {1097#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {1097#true} is VALID [2018-11-14 17:22:28,423 INFO L273 TraceCheckUtils]: 9: Hoare triple {1097#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1097#true} is VALID [2018-11-14 17:22:28,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-14 17:22:28,424 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1097#true} {1097#true} #115#return; {1097#true} is VALID [2018-11-14 17:22:28,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {1097#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1097#true} is VALID [2018-11-14 17:22:28,424 INFO L256 TraceCheckUtils]: 13: Hoare triple {1097#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1097#true} is VALID [2018-11-14 17:22:28,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {1097#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1097#true} is VALID [2018-11-14 17:22:28,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {1097#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {1097#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {1097#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L256 TraceCheckUtils]: 20: Hoare triple {1097#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1097#true} is VALID [2018-11-14 17:22:28,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {1097#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1097#true} is VALID [2018-11-14 17:22:28,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {1097#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1097#true} is VALID [2018-11-14 17:22:28,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {1097#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1097#true} is VALID [2018-11-14 17:22:28,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {1097#true} assume true; {1097#true} is VALID [2018-11-14 17:22:28,426 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1097#true} {1097#true} #119#return; {1097#true} is VALID [2018-11-14 17:22:28,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {1097#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1097#true} is VALID [2018-11-14 17:22:28,427 INFO L256 TraceCheckUtils]: 27: Hoare triple {1097#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1097#true} is VALID [2018-11-14 17:22:28,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {1097#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1099#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:28,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {1099#(not (= 0 insert_list_~l.base))} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1099#(not (= 0 insert_list_~l.base))} is VALID [2018-11-14 17:22:28,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {1099#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,436 INFO L273 TraceCheckUtils]: 31: Hoare triple {1100#(not (= 0 ~head~0.base))} assume true; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,438 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1100#(not (= 0 ~head~0.base))} {1097#true} #121#return; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,438 INFO L273 TraceCheckUtils]: 33: Hoare triple {1100#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,440 INFO L273 TraceCheckUtils]: 34: Hoare triple {1100#(not (= 0 ~head~0.base))} assume true; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,440 INFO L273 TraceCheckUtils]: 35: Hoare triple {1100#(not (= 0 ~head~0.base))} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, ~mylist~0.offset + 4, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,441 INFO L273 TraceCheckUtils]: 36: Hoare triple {1100#(not (= 0 ~head~0.base))} assume true; {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {1100#(not (= 0 ~head~0.base))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1100#(not (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,443 INFO L256 TraceCheckUtils]: 38: Hoare triple {1100#(not (= 0 ~head~0.base))} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1097#true} is VALID [2018-11-14 17:22:28,452 INFO L273 TraceCheckUtils]: 39: Hoare triple {1097#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1101#(= ~head~0.base search_list_~l.base)} is VALID [2018-11-14 17:22:28,452 INFO L273 TraceCheckUtils]: 40: Hoare triple {1101#(= ~head~0.base search_list_~l.base)} assume true; {1101#(= ~head~0.base search_list_~l.base)} is VALID [2018-11-14 17:22:28,453 INFO L273 TraceCheckUtils]: 41: Hoare triple {1101#(= ~head~0.base search_list_~l.base)} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1102#(or |search_list_#t~short29| (= 0 ~head~0.base))} is VALID [2018-11-14 17:22:28,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {1102#(or |search_list_#t~short29| (= 0 ~head~0.base))} assume !#t~short29; {1103#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:28,454 INFO L273 TraceCheckUtils]: 43: Hoare triple {1103#(= 0 ~head~0.base)} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1103#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:28,455 INFO L273 TraceCheckUtils]: 44: Hoare triple {1103#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {1103#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:28,458 INFO L273 TraceCheckUtils]: 45: Hoare triple {1103#(= 0 ~head~0.base)} assume true; {1103#(= 0 ~head~0.base)} is VALID [2018-11-14 17:22:28,459 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1103#(= 0 ~head~0.base)} {1100#(not (= 0 ~head~0.base))} #123#return; {1098#false} is VALID [2018-11-14 17:22:28,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {1098#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {1098#false} is VALID [2018-11-14 17:22:28,459 INFO L256 TraceCheckUtils]: 48: Hoare triple {1098#false} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {1098#false} is VALID [2018-11-14 17:22:28,459 INFO L273 TraceCheckUtils]: 49: Hoare triple {1098#false} ~cond := #in~cond; {1098#false} is VALID [2018-11-14 17:22:28,459 INFO L273 TraceCheckUtils]: 50: Hoare triple {1098#false} assume ~cond == 0; {1098#false} is VALID [2018-11-14 17:22:28,460 INFO L273 TraceCheckUtils]: 51: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2018-11-14 17:22:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 17:22:28,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:22:28,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:22:28,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-14 17:22:28,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:28,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:22:28,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:28,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:22:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:22:28,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:22:28,519 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 7 states. [2018-11-14 17:22:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:29,284 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 17:22:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:22:29,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-11-14 17:22:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:22:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:22:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:22:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:22:29,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2018-11-14 17:22:29,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:29,412 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:22:29,412 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:22:29,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:22:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:22:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-14 17:22:29,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:29,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:29,485 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:29,485 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:29,489 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 17:22:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 17:22:29,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:29,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:29,490 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-14 17:22:29,490 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-14 17:22:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:29,493 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 17:22:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 17:22:29,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:29,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:29,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:29,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:22:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 17:22:29,496 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 52 [2018-11-14 17:22:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:29,497 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 17:22:29,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:22:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:22:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 17:22:29,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:29,499 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:29,499 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:29,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1625054643, now seen corresponding path program 1 times [2018-11-14 17:22:29,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:29,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:29,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:29,815 INFO L256 TraceCheckUtils]: 0: Hoare triple {1357#true} call ULTIMATE.init(); {1357#true} is VALID [2018-11-14 17:22:29,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {1357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2018-11-14 17:22:29,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1357#true} {1357#true} #129#return; {1357#true} is VALID [2018-11-14 17:22:29,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {1357#true} call #t~ret45 := main(); {1357#true} is VALID [2018-11-14 17:22:29,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {1357#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1357#true} is VALID [2018-11-14 17:22:29,817 INFO L256 TraceCheckUtils]: 6: Hoare triple {1357#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1357#true} is VALID [2018-11-14 17:22:29,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1359#(and (<= insert_list_~k |insert_list_#in~k|) (<= |insert_list_#in~k| insert_list_~k))} is VALID [2018-11-14 17:22:29,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {1359#(and (<= insert_list_~k |insert_list_#in~k|) (<= |insert_list_#in~k| insert_list_~k))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:29,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:29,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,820 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1357#true} {1357#true} #115#return; {1357#true} is VALID [2018-11-14 17:22:29,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {1357#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1357#true} is VALID [2018-11-14 17:22:29,820 INFO L256 TraceCheckUtils]: 13: Hoare triple {1357#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1357#true} is VALID [2018-11-14 17:22:29,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:29,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:29,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:29,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,821 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1357#true} {1357#true} #117#return; {1357#true} is VALID [2018-11-14 17:22:29,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {1357#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1357#true} is VALID [2018-11-14 17:22:29,822 INFO L256 TraceCheckUtils]: 20: Hoare triple {1357#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1357#true} is VALID [2018-11-14 17:22:29,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:29,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:29,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:29,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,823 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1357#true} {1357#true} #119#return; {1357#true} is VALID [2018-11-14 17:22:29,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {1357#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1357#true} is VALID [2018-11-14 17:22:29,823 INFO L256 TraceCheckUtils]: 27: Hoare triple {1357#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1357#true} is VALID [2018-11-14 17:22:29,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:29,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:29,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:29,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,825 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1357#true} {1357#true} #121#return; {1357#true} is VALID [2018-11-14 17:22:29,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {1357#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1357#true} is VALID [2018-11-14 17:22:29,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {1357#true} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, ~mylist~0.offset + 4, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1357#true} is VALID [2018-11-14 17:22:29,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:29,826 INFO L273 TraceCheckUtils]: 37: Hoare triple {1357#true} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1357#true} is VALID [2018-11-14 17:22:29,826 INFO L256 TraceCheckUtils]: 38: Hoare triple {1357#true} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1357#true} is VALID [2018-11-14 17:22:29,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume true; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,837 INFO L273 TraceCheckUtils]: 41: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,839 INFO L273 TraceCheckUtils]: 43: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume !!#t~short29;havoc #t~mem28;havoc #t~short29;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~l.base, ~l.offset + 4, 4);~l.base, ~l.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume true; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:29,842 INFO L273 TraceCheckUtils]: 46: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {1361#(or |search_list_#t~short29| (= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|))} is VALID [2018-11-14 17:22:29,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {1361#(or |search_list_#t~short29| (= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1362#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:29,843 INFO L273 TraceCheckUtils]: 48: Hoare triple {1362#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} #res.base, #res.offset := ~l.base, ~l.offset; {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-14 17:22:29,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} assume true; {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-14 17:22:29,846 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} {1357#true} #123#return; {1364#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} is VALID [2018-11-14 17:22:29,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {1364#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {1365#(= 2 |main_#t~mem42|)} is VALID [2018-11-14 17:22:29,848 INFO L256 TraceCheckUtils]: 52: Hoare triple {1365#(= 2 |main_#t~mem42|)} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {1366#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:22:29,849 INFO L273 TraceCheckUtils]: 53: Hoare triple {1366#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1367#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:22:29,856 INFO L273 TraceCheckUtils]: 54: Hoare triple {1367#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1358#false} is VALID [2018-11-14 17:22:29,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {1358#false} assume !false; {1358#false} is VALID [2018-11-14 17:22:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 17:22:29,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:22:29,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:22:29,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:29,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:22:30,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 17:22:30,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:22:30,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:22:30,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:30,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:22:30,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-14 17:22:30,656 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:22:30,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {1357#true} call ULTIMATE.init(); {1357#true} is VALID [2018-11-14 17:22:30,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {1357#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1357#true} is VALID [2018-11-14 17:22:30,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1357#true} {1357#true} #129#return; {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L256 TraceCheckUtils]: 4: Hoare triple {1357#true} call #t~ret45 := main(); {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {1357#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L256 TraceCheckUtils]: 6: Hoare triple {1357#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {1357#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(0, 0, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:30,694 INFO L273 TraceCheckUtils]: 9: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:30,695 INFO L273 TraceCheckUtils]: 10: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,695 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1357#true} {1357#true} #115#return; {1357#true} is VALID [2018-11-14 17:22:30,695 INFO L273 TraceCheckUtils]: 12: Hoare triple {1357#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1357#true} is VALID [2018-11-14 17:22:30,695 INFO L256 TraceCheckUtils]: 13: Hoare triple {1357#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1357#true} is VALID [2018-11-14 17:22:30,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:30,696 INFO L273 TraceCheckUtils]: 15: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:30,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:30,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,697 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1357#true} {1357#true} #117#return; {1357#true} is VALID [2018-11-14 17:22:30,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {1357#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1357#true} is VALID [2018-11-14 17:22:30,697 INFO L256 TraceCheckUtils]: 20: Hoare triple {1357#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1357#true} is VALID [2018-11-14 17:22:30,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:30,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:30,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:30,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,698 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1357#true} {1357#true} #119#return; {1357#true} is VALID [2018-11-14 17:22:30,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {1357#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1357#true} is VALID [2018-11-14 17:22:30,699 INFO L256 TraceCheckUtils]: 27: Hoare triple {1357#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1357#true} is VALID [2018-11-14 17:22:30,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1357#true} is VALID [2018-11-14 17:22:30,699 INFO L273 TraceCheckUtils]: 29: Hoare triple {1357#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset + 0, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, ~l.offset + 4, 4); {1357#true} is VALID [2018-11-14 17:22:30,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {1357#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1357#true} is VALID [2018-11-14 17:22:30,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,700 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1357#true} {1357#true} #121#return; {1357#true} is VALID [2018-11-14 17:22:30,700 INFO L273 TraceCheckUtils]: 33: Hoare triple {1357#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1357#true} is VALID [2018-11-14 17:22:30,700 INFO L273 TraceCheckUtils]: 34: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {1357#true} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, ~mylist~0.offset + 4, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1357#true} is VALID [2018-11-14 17:22:30,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {1357#true} assume true; {1357#true} is VALID [2018-11-14 17:22:30,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {1357#true} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1357#true} is VALID [2018-11-14 17:22:30,701 INFO L256 TraceCheckUtils]: 38: Hoare triple {1357#true} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1357#true} is VALID [2018-11-14 17:22:30,714 INFO L273 TraceCheckUtils]: 39: Hoare triple {1357#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume true; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume !!#t~short29;havoc #t~mem28;havoc #t~short29;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~l.base, ~l.offset + 4, 4);~l.base, ~l.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume true; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,742 INFO L273 TraceCheckUtils]: 45: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-14 17:22:30,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {1360#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset + 0, 4);#t~short29 := #t~mem28 != ~k; {1509#(or (and (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (not |search_list_#t~short29|) (<= |search_list_#in~k| (select (select |#memory_int| search_list_~l.base) search_list_~l.offset))) (and |search_list_#t~short29| (or (<= (+ |search_list_#in~k| 1) (select (select |#memory_int| search_list_~l.base) search_list_~l.offset)) (<= (+ (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) 1) |search_list_#in~k|))))} is VALID [2018-11-14 17:22:30,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {1509#(or (and (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (not |search_list_#t~short29|) (<= |search_list_#in~k| (select (select |#memory_int| search_list_~l.base) search_list_~l.offset))) (and |search_list_#t~short29| (or (<= (+ |search_list_#in~k| 1) (select (select |#memory_int| search_list_~l.base) search_list_~l.offset)) (<= (+ (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) 1) |search_list_#in~k|))))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1362#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} is VALID [2018-11-14 17:22:30,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {1362#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} #res.base, #res.offset := ~l.base, ~l.offset; {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-14 17:22:30,756 INFO L273 TraceCheckUtils]: 49: Hoare triple {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} assume true; {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-14 17:22:30,759 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1363#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} {1357#true} #123#return; {1364#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} is VALID [2018-11-14 17:22:30,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {1364#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset + 0, 4); {1365#(= 2 |main_#t~mem42|)} is VALID [2018-11-14 17:22:30,766 INFO L256 TraceCheckUtils]: 52: Hoare triple {1365#(= 2 |main_#t~mem42|)} call __VERIFIER_assert((if #t~mem42 == 2 then 1 else 0)); {1366#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:22:30,767 INFO L273 TraceCheckUtils]: 53: Hoare triple {1366#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1367#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:22:30,767 INFO L273 TraceCheckUtils]: 54: Hoare triple {1367#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {1358#false} is VALID [2018-11-14 17:22:30,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {1358#false} assume !false; {1358#false} is VALID [2018-11-14 17:22:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-14 17:22:30,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:22:30,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-11-14 17:22:30,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-14 17:22:30,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:22:30,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:22:30,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:30,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:22:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:22:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:22:30,864 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 12 states. [2018-11-14 17:22:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:31,978 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-14 17:22:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:22:31,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-14 17:22:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:22:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:22:31,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 17:22:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:22:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 17:22:31,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-14 17:22:32,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:22:32,097 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:22:32,097 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:22:32,098 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:22:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:22:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-14 17:22:32,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:22:32,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:32,143 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:32,143 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-14 17:22:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:32,146 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 17:22:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 17:22:32,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:32,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:32,147 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-14 17:22:32,147 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-14 17:22:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:22:32,150 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-14 17:22:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 17:22:32,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:22:32,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:22:32,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:22:32,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:22:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:22:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-14 17:22:32,153 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 56 [2018-11-14 17:22:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:22:32,154 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-14 17:22:32,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:22:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-14 17:22:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 17:22:32,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:22:32,155 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:22:32,155 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:22:32,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:22:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2018081653, now seen corresponding path program 1 times [2018-11-14 17:22:32,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:22:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:22:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:22:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:22:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:22:33,231 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:22:33,236 INFO L168 Benchmark]: Toolchain (without parser) took 15422.42 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 887.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -471.1 MB). Peak memory consumption was 415.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:33,238 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:22:33,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:33,239 INFO L168 Benchmark]: Boogie Preprocessor took 138.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:33,240 INFO L168 Benchmark]: RCFGBuilder took 1777.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:33,240 INFO L168 Benchmark]: TraceAbstraction took 12454.61 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 145.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 216.5 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:22:33,244 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1045.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.81 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1777.32 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.4 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12454.61 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 145.8 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 216.5 MB). Peak memory consumption was 362.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...