/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:16:08,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:16:08,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:16:08,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:16:08,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:16:08,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:16:08,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:16:08,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:16:08,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:16:08,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:16:08,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:16:08,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:16:08,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:16:08,756 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:16:08,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:16:08,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:16:08,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:16:08,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:16:08,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:16:08,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:16:08,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:16:08,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:16:08,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:16:08,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:16:08,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:16:08,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:16:08,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:16:08,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:16:08,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:16:08,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:16:08,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:16:08,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:16:08,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:16:08,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:16:08,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:16:08,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:16:08,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:16:08,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:16:08,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:16:08,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:16:08,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:16:08,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:16:08,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:16:08,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:16:08,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:16:08,806 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:16:08,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:16:08,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:16:08,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:16:08,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:16:08,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:16:08,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:16:08,807 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:16:08,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:16:08,808 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:16:08,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:16:08,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:16:08,808 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:16:08,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:16:08,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:16:08,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:16:08,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:16:08,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:16:08,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:16:08,810 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:16:09,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:16:09,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:16:09,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:16:09,193 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:16:09,193 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:16:09,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-11-07 05:16:09,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035c74a/88382a50a5e5436b8ef1f73612a86074/FLAGa8078e0e7 [2020-11-07 05:16:09,887 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:16:09,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.c_1.i [2020-11-07 05:16:09,902 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035c74a/88382a50a5e5436b8ef1f73612a86074/FLAGa8078e0e7 [2020-11-07 05:16:10,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa035c74a/88382a50a5e5436b8ef1f73612a86074 [2020-11-07 05:16:10,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:16:10,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:16:10,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:16:10,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:16:10,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:16:10,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678c656f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10, skipping insertion in model container [2020-11-07 05:16:10,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:16:10,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:16:10,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:16:10,539 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:16:10,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:16:10,709 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:16:10,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10 WrapperNode [2020-11-07 05:16:10,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:16:10,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:16:10,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:16:10,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:16:10,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... [2020-11-07 05:16:10,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:16:10,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:16:10,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:16:10,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:16:10,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:16:10,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:16:10,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:16:10,956 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:16:10,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2020-11-07 05:16:10,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2020-11-07 05:16:10,957 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2020-11-07 05:16:10,958 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2020-11-07 05:16:10,958 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2020-11-07 05:16:10,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:16:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:16:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:16:10,958 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:16:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:16:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2020-11-07 05:16:10,959 INFO L130 BoogieDeclarations]: Found specification of procedure __underflow [2020-11-07 05:16:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure __uflow [2020-11-07 05:16:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure __overflow [2020-11-07 05:16:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_getc [2020-11-07 05:16:10,960 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_putc [2020-11-07 05:16:10,961 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_feof [2020-11-07 05:16:10,962 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ferror [2020-11-07 05:16:10,962 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_peekc_locked [2020-11-07 05:16:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_flockfile [2020-11-07 05:16:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_funlockfile [2020-11-07 05:16:10,965 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_ftrylockfile [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfscanf [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_vfprintf [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_padn [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_sgetn [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekoff [2020-11-07 05:16:10,966 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_seekpos [2020-11-07 05:16:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure _IO_free_backup_area [2020-11-07 05:16:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2020-11-07 05:16:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure rename [2020-11-07 05:16:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure renameat [2020-11-07 05:16:10,967 INFO L130 BoogieDeclarations]: Found specification of procedure tmpfile [2020-11-07 05:16:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam [2020-11-07 05:16:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure tmpnam_r [2020-11-07 05:16:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure tempnam [2020-11-07 05:16:10,968 INFO L130 BoogieDeclarations]: Found specification of procedure fclose [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_unlocked [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure freopen [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure fdopen [2020-11-07 05:16:10,969 INFO L130 BoogieDeclarations]: Found specification of procedure fmemopen [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure open_memstream [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure setbuf [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure setvbuf [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure setbuffer [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure setlinebuf [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure fprintf [2020-11-07 05:16:10,970 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure vfprintf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure vprintf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure vsprintf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2020-11-07 05:16:10,971 INFO L130 BoogieDeclarations]: Found specification of procedure vsnprintf [2020-11-07 05:16:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure vdprintf [2020-11-07 05:16:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure dprintf [2020-11-07 05:16:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure fscanf [2020-11-07 05:16:10,972 INFO L130 BoogieDeclarations]: Found specification of procedure scanf [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure sscanf [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure vfscanf [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure vscanf [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure vsscanf [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-11-07 05:16:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure getchar [2020-11-07 05:16:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure getc_unlocked [2020-11-07 05:16:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure getchar_unlocked [2020-11-07 05:16:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure fgetc_unlocked [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure fputc [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure putc [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure fputc_unlocked [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure putc_unlocked [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure putchar_unlocked [2020-11-07 05:16:10,975 INFO L130 BoogieDeclarations]: Found specification of procedure getw [2020-11-07 05:16:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure putw [2020-11-07 05:16:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2020-11-07 05:16:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure gets [2020-11-07 05:16:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure __getdelim [2020-11-07 05:16:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure getdelim [2020-11-07 05:16:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure getline [2020-11-07 05:16:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure fputs [2020-11-07 05:16:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2020-11-07 05:16:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure ungetc [2020-11-07 05:16:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure fread [2020-11-07 05:16:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite [2020-11-07 05:16:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure fread_unlocked [2020-11-07 05:16:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure fwrite_unlocked [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure fseek [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ftell [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure rewind [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure fseeko [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ftello [2020-11-07 05:16:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure fgetpos [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure fsetpos [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure feof [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure ferror [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure clearerr_unlocked [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure feof_unlocked [2020-11-07 05:16:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure ferror_unlocked [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure perror [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure fileno [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure fileno_unlocked [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure popen [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure pclose [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure ctermid [2020-11-07 05:16:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure flockfile [2020-11-07 05:16:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure ftrylockfile [2020-11-07 05:16:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure funlockfile [2020-11-07 05:16:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:16:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:16:10,985 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-11-07 05:16:10,985 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:16:10,985 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-11-07 05:16:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure memalign [2020-11-07 05:16:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-11-07 05:16:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure pvalloc [2020-11-07 05:16:10,986 INFO L130 BoogieDeclarations]: Found specification of procedure __default_morecore [2020-11-07 05:16:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure mallinfo [2020-11-07 05:16:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure mallopt [2020-11-07 05:16:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_trim [2020-11-07 05:16:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_usable_size [2020-11-07 05:16:10,987 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_stats [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_info [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_get_state [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure malloc_set_state [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure __malloc_check_init [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2020-11-07 05:16:10,988 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2020-11-07 05:16:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2020-11-07 05:16:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2020-11-07 05:16:10,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:16:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:16:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:16:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-11-07 05:16:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:16:10,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:16:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:16:10,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:16:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:16:11,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:16:11,649 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:16:11,649 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:16:11,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:16:11 BoogieIcfgContainer [2020-11-07 05:16:11,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:16:11,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:16:11,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:16:11,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:16:11,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:16:10" (1/3) ... [2020-11-07 05:16:11,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11088415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:16:11, skipping insertion in model container [2020-11-07 05:16:11,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:16:10" (2/3) ... [2020-11-07 05:16:11,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11088415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:16:11, skipping insertion in model container [2020-11-07 05:16:11,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:16:11" (3/3) ... [2020-11-07 05:16:11,660 INFO L111 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2020-11-07 05:16:11,676 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:16:11,680 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:16:11,693 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:16:11,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:16:11,719 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:16:11,719 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:16:11,719 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:16:11,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:16:11,720 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:16:11,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:16:11,720 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:16:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-11-07 05:16:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 05:16:11,748 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:11,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:11,750 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:11,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1653385351, now seen corresponding path program 1 times [2020-11-07 05:16:11,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:11,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546659044] [2020-11-07 05:16:11,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:12,210 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-11-07 05:16:12,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:16:12,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546659044] [2020-11-07 05:16:12,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:16:12,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 05:16:12,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811595220] [2020-11-07 05:16:12,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:16:12,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:12,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:16:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:16:12,316 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 7 states. [2020-11-07 05:16:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:13,019 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2020-11-07 05:16:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:16:13,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-07 05:16:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:13,032 INFO L225 Difference]: With dead ends: 138 [2020-11-07 05:16:13,033 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:16:13,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:16:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:16:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2020-11-07 05:16:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 05:16:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2020-11-07 05:16:13,095 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 27 [2020-11-07 05:16:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:13,095 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2020-11-07 05:16:13,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:16:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2020-11-07 05:16:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:16:13,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:13,099 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:13,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:16:13,099 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:13,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash 818741348, now seen corresponding path program 1 times [2020-11-07 05:16:13,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:13,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1716687059] [2020-11-07 05:16:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:16:13,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1716687059] [2020-11-07 05:16:13,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:16:13,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 05:16:13,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628619325] [2020-11-07 05:16:13,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:16:13,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:16:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:16:13,437 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 9 states. [2020-11-07 05:16:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:13,785 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2020-11-07 05:16:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:16:13,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-11-07 05:16:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:13,789 INFO L225 Difference]: With dead ends: 106 [2020-11-07 05:16:13,789 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:16:13,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:16:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:16:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2020-11-07 05:16:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 05:16:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2020-11-07 05:16:13,811 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 67 [2020-11-07 05:16:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:13,811 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2020-11-07 05:16:13,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:16:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2020-11-07 05:16:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:16:13,814 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:13,814 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:13,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:16:13,815 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash -645962233, now seen corresponding path program 1 times [2020-11-07 05:16:13,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:13,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [529299763] [2020-11-07 05:16:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:13,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-07 05:16:14,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [529299763] [2020-11-07 05:16:14,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:14,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:16:14,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176811649] [2020-11-07 05:16:14,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:16:14,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:16:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:16:14,072 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2020-11-07 05:16:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:14,413 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2020-11-07 05:16:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:16:14,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2020-11-07 05:16:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:14,415 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:16:14,415 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 05:16:14,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:16:14,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 05:16:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2020-11-07 05:16:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:16:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-11-07 05:16:14,436 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 67 [2020-11-07 05:16:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:14,437 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-11-07 05:16:14,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:16:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-11-07 05:16:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 05:16:14,438 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:14,439 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:14,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:16:14,439 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1821270998, now seen corresponding path program 1 times [2020-11-07 05:16:14,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:14,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709062042] [2020-11-07 05:16:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-11-07 05:16:14,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709062042] [2020-11-07 05:16:14,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:14,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:16:14,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716262773] [2020-11-07 05:16:14,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:16:14,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:16:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:16:14,969 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 17 states. [2020-11-07 05:16:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:16,560 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2020-11-07 05:16:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:16:16,560 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2020-11-07 05:16:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:16,567 INFO L225 Difference]: With dead ends: 116 [2020-11-07 05:16:16,567 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 05:16:16,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:16:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 05:16:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2020-11-07 05:16:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 05:16:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2020-11-07 05:16:16,625 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 67 [2020-11-07 05:16:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:16,628 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2020-11-07 05:16:16,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:16:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2020-11-07 05:16:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 05:16:16,630 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:16,630 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:16,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:16:16,633 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:16,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1472109846, now seen corresponding path program 1 times [2020-11-07 05:16:16,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:16,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [273450414] [2020-11-07 05:16:16,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:16,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:16,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:16,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:17,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:17,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:17,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:16:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:16:17,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [273450414] [2020-11-07 05:16:17,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:17,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:16:17,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291964403] [2020-11-07 05:16:17,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:16:17,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:16:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:16:17,118 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand 18 states. [2020-11-07 05:16:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:18,518 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2020-11-07 05:16:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:16:18,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 76 [2020-11-07 05:16:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:18,525 INFO L225 Difference]: With dead ends: 120 [2020-11-07 05:16:18,525 INFO L226 Difference]: Without dead ends: 110 [2020-11-07 05:16:18,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:16:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-07 05:16:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2020-11-07 05:16:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 05:16:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2020-11-07 05:16:18,581 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 76 [2020-11-07 05:16:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:18,584 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2020-11-07 05:16:18,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:16:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2020-11-07 05:16:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 05:16:18,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:18,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:18,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:16:18,591 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:18,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2079566711, now seen corresponding path program 1 times [2020-11-07 05:16:18,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:18,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632979083] [2020-11-07 05:16:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:18,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:18,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:18,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:18,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:18,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:19,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:16:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:16:19,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632979083] [2020-11-07 05:16:19,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:19,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:16:19,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039182840] [2020-11-07 05:16:19,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:16:19,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:16:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:16:19,193 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 23 states. [2020-11-07 05:16:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:21,127 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2020-11-07 05:16:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:16:21,128 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 77 [2020-11-07 05:16:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:21,131 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:16:21,131 INFO L226 Difference]: Without dead ends: 111 [2020-11-07 05:16:21,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2020-11-07 05:16:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-07 05:16:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2020-11-07 05:16:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 05:16:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2020-11-07 05:16:21,186 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 77 [2020-11-07 05:16:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:21,186 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2020-11-07 05:16:21,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:16:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2020-11-07 05:16:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-07 05:16:21,188 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:21,189 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:21,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:16:21,189 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1754951300, now seen corresponding path program 1 times [2020-11-07 05:16:21,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:21,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430088524] [2020-11-07 05:16:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:16:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 05:16:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 05:16:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 05:16:21,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [430088524] [2020-11-07 05:16:21,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:21,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:16:21,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129504251] [2020-11-07 05:16:21,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:16:21,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:16:21,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:16:21,839 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 24 states. [2020-11-07 05:16:23,763 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-11-07 05:16:24,111 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-11-07 05:16:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:24,454 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-11-07 05:16:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 05:16:24,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-11-07 05:16:24,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:24,458 INFO L225 Difference]: With dead ends: 142 [2020-11-07 05:16:24,458 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 05:16:24,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=319, Invalid=2543, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 05:16:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 05:16:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-11-07 05:16:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 05:16:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2020-11-07 05:16:24,490 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 91 [2020-11-07 05:16:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:24,491 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2020-11-07 05:16:24,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:16:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2020-11-07 05:16:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-07 05:16:24,493 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:24,493 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:24,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:16:24,494 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -188247350, now seen corresponding path program 2 times [2020-11-07 05:16:24,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:24,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [135368707] [2020-11-07 05:16:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:16:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-07 05:16:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:24,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 05:16:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 05:16:25,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [135368707] [2020-11-07 05:16:25,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:25,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:16:25,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381623158] [2020-11-07 05:16:25,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:16:25,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:16:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:16:25,040 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 24 states. [2020-11-07 05:16:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:26,960 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2020-11-07 05:16:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:16:26,961 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 91 [2020-11-07 05:16:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:26,963 INFO L225 Difference]: With dead ends: 141 [2020-11-07 05:16:26,963 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 05:16:26,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=1748, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:16:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 05:16:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2020-11-07 05:16:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 05:16:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2020-11-07 05:16:26,993 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 91 [2020-11-07 05:16:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:26,994 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2020-11-07 05:16:26,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:16:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2020-11-07 05:16:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 05:16:26,995 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:26,996 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2020-11-07 05:16:26,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:16:26,996 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -462605947, now seen corresponding path program 1 times [2020-11-07 05:16:26,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:26,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2010679595] [2020-11-07 05:16:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:16:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-07 05:16:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:16:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-07 05:16:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 05:16:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 05:16:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-11-07 05:16:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:16:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-11-07 05:16:27,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2010679595] [2020-11-07 05:16:27,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:16:27,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:16:27,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571239061] [2020-11-07 05:16:27,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:16:27,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:16:27,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:16:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:16:27,412 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 19 states. [2020-11-07 05:16:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:16:29,103 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-11-07 05:16:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 05:16:29,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2020-11-07 05:16:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:16:29,105 INFO L225 Difference]: With dead ends: 163 [2020-11-07 05:16:29,107 INFO L226 Difference]: Without dead ends: 149 [2020-11-07 05:16:29,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 05:16:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-11-07 05:16:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2020-11-07 05:16:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-11-07 05:16:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2020-11-07 05:16:29,148 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 92 [2020-11-07 05:16:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:16:29,149 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2020-11-07 05:16:29,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:16:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2020-11-07 05:16:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 05:16:29,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:16:29,152 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:16:29,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:16:29,152 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:16:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:16:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash -472690422, now seen corresponding path program 1 times [2020-11-07 05:16:29,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:16:29,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938953739] [2020-11-07 05:16:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:16:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:16:29,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:16:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:16:29,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:16:29,277 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:16:29,278 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:16:29,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:16:29,342 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,343 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,345 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,345 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,348 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,349 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# [2020-11-07 05:16:29,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:16:29 BoogieIcfgContainer [2020-11-07 05:16:29,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:16:29,405 INFO L168 Benchmark]: Toolchain (without parser) took 19221.88 ms. Allocated memory was 156.2 MB in the beginning and 342.9 MB in the end (delta: 186.6 MB). Free memory was 131.3 MB in the beginning and 282.6 MB in the end (delta: -151.3 MB). Peak memory consumption was 35.8 MB. Max. memory is 8.0 GB. [2020-11-07 05:16:29,406 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 156.2 MB. Free memory is still 129.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:16:29,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.78 ms. Allocated memory is still 156.2 MB. Free memory was 130.7 MB in the beginning and 106.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:16:29,407 INFO L168 Benchmark]: Boogie Preprocessor took 96.86 ms. Allocated memory is still 156.2 MB. Free memory was 106.7 MB in the beginning and 104.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:16:29,408 INFO L168 Benchmark]: RCFGBuilder took 842.95 ms. Allocated memory is still 156.2 MB. Free memory was 104.0 MB in the beginning and 93.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:16:29,409 INFO L168 Benchmark]: TraceAbstraction took 17748.62 ms. Allocated memory was 156.2 MB in the beginning and 342.9 MB in the end (delta: 186.6 MB). Free memory was 93.3 MB in the beginning and 282.6 MB in the end (delta: -189.3 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:16:29,415 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 156.2 MB. Free memory is still 129.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 520.78 ms. Allocated memory is still 156.2 MB. Free memory was 130.7 MB in the beginning and 106.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 96.86 ms. Allocated memory is still 156.2 MB. Free memory was 106.7 MB in the beginning and 104.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 842.95 ms. Allocated memory is still 156.2 MB. Free memory was 104.0 MB in the beginning and 93.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17748.62 ms. Allocated memory was 156.2 MB in the beginning and 342.9 MB in the end (delta: 186.6 MB). Free memory was 93.3 MB in the beginning and 282.6 MB in the end (delta: -189.3 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 62 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 61 could not be translated for associated CType STRUCT~~list_head?prev~*list_head?next~*list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L869] void * guard_malloc_counter = 0; VAL [\old(elem)=53, \old(elem)=49, \old(guard_malloc_counter)=51, \old(guard_malloc_counter)=60, \old(head)=null, \old(head)=null, elem={53:49}, guard_malloc_counter={0:0}, head={62:61}] [L889] struct list_head *elem = ((void *)0); VAL [\old(elem)=53, \old(elem)=49, \old(guard_malloc_counter)=51, \old(guard_malloc_counter)=60, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={62:61}] [L902] static struct list_head head; VAL [\old(elem)=53, \old(elem)=49, \old(guard_malloc_counter)=60, \old(guard_malloc_counter)=51, \old(head)=null, \old(head)=null, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L905] struct list_head *dev1, *dev2; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L906] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L881] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}] [L873] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:0}, head={3:0}, size=8] [L874] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L875] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L877] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L881] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L881] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, \old(size)=8, \result={0:1}, __getMemory(size)={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L906] RET, EXPR my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L906] dev1 = my_malloc(sizeof(*dev1)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, my_malloc(sizeof(*dev1))={0:1}] [L907] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L881] CALL, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}] [L873] (size > 0) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:1}, head={3:0}, size=8] [L874] guard_malloc_counter++ VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L875] COND FALSE !(!__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L877] return (void *) guard_malloc_counter; VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, \result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L881] RET, EXPR __getMemory(size) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=1, \old(guard_malloc_counter)=0, \old(size)=8, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L881] return __getMemory(size); VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=1, \old(size)=8, \result={0:2}, __getMemory(size)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, size=8] [L907] RET, EXPR my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L907] dev2 = my_malloc(sizeof(*dev2)) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, my_malloc(sizeof(*dev2))={0:2}] [L908] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L909] CALL list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L893] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L909] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}] [L910] CALL list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L893] COND TRUE __VERIFIER_nondet_int() VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=1, elem={0:0}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L894] elem = new VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L910] RET list_add(dev1, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L911] CALL list_del(dev2) VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L898] COND FALSE !(entry==elem) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, entry={0:2}, entry={0:2}, guard_malloc_counter={0:2}, head={3:0}] [L911] RET list_del(dev2) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L912] CALL list_add(dev2, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:2}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L893] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, __VERIFIER_nondet_int()=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:2}, new={0:2}] [L912] RET list_add(dev2, &head) VAL [\old(elem)=0, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L915] CALL list_add(dev1, &head) VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, new={0:1}] [L892] (new!=elem) ? (0) : __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}, head={3:0}, head={3:0}, new={0:1}, new={0:1}] [L892] CALL __blast_assert () VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L8] CALL reach_error() VAL [\old(elem)=0, \old(elem)=1, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] [L3] __assert_fail("0", "rule60_list2.c_1.i", 3, "reach_error") VAL [\old(elem)=1, \old(elem)=0, \old(guard_malloc_counter)=0, \old(guard_malloc_counter)=0, elem={0:1}, guard_malloc_counter={0:2}, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.5s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 582 SDtfs, 1054 SDslu, 2523 SDs, 0 SdLazy, 6583 SolverSat, 543 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 216634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 104/179 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...