/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/bubble_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:41:23,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:41:23,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:41:23,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:41:23,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:41:23,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:41:23,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:41:23,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:41:24,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:41:24,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:41:24,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:41:24,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:41:24,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:41:24,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:41:24,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:41:24,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:41:24,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:41:24,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:41:24,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:41:24,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:41:24,011 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:41:24,012 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:41:24,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:41:24,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:41:24,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:41:24,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:41:24,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:41:24,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:41:24,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:41:24,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:41:24,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:41:24,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:41:24,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:41:24,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:41:24,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:41:24,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:41:24,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:41:24,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:41:24,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:41:24,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:41:24,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:41:24,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:41:24,023 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:41:24,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:41:24,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:41:24,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:41:24,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:41:24,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:41:24,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:24,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:41:24,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:41:24,037 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:41:24,037 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 02:41:24,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:41:24,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:41:24,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:41:24,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:41:24,262 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:41:24,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/bubble_sort-2.i [2022-04-28 02:41:24,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d40648e/1b5cd7c1c9b34a6bbac1209d32e3fb97/FLAG33124835b [2022-04-28 02:41:24,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:41:24,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i [2022-04-28 02:41:24,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d40648e/1b5cd7c1c9b34a6bbac1209d32e3fb97/FLAG33124835b [2022-04-28 02:41:25,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59d40648e/1b5cd7c1c9b34a6bbac1209d32e3fb97 [2022-04-28 02:41:25,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:41:25,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:41:25,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:25,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:41:25,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:41:25,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d46bea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25, skipping insertion in model container [2022-04-28 02:41:25,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:41:25,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:41:25,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-04-28 02:41:25,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:25,329 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:41:25,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/bubble_sort-2.i[1830,1843] [2022-04-28 02:41:25,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:41:25,407 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:41:25,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25 WrapperNode [2022-04-28 02:41:25,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:41:25,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:41:25,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:41:25,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:41:25,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:41:25,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:41:25,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:41:25,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:41:25,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (1/1) ... [2022-04-28 02:41:25,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:41:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:41:25,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 02:41:25,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 02:41:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:41:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:41:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:41:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-04-28 02:41:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-04-28 02:41:25,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-04-28 02:41:25,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_del [2022-04-28 02:41:25,629 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-04-28 02:41:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure list_move [2022-04-28 02:41:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_insert [2022-04-28 02:41:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_read [2022-04-28 02:41:25,630 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_destroy [2022-04-28 02:41:25,631 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-04-28 02:41:25,631 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2022-04-28 02:41:25,631 INFO L138 BoogieDeclarations]: Found implementation of procedure gl_sort [2022-04-28 02:41:25,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:41:25,632 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure __list_del [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure list_move [2022-04-28 02:41:25,635 INFO L130 BoogieDeclarations]: Found specification of procedure gl_insert [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure gl_read [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure gl_destroy [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure gl_sort [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:41:25,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-04-28 02:41:25,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:41:25,817 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:41:25,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:41:26,041 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2022-04-28 02:41:26,307 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:41:26,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:41:26,314 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-04-28 02:41:26,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26 BoogieIcfgContainer [2022-04-28 02:41:26,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:41:26,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:41:26,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:41:26,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:41:26,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:41:25" (1/3) ... [2022-04-28 02:41:26,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f400da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 02:41:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:41:25" (2/3) ... [2022-04-28 02:41:26,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f400da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:41:26, skipping insertion in model container [2022-04-28 02:41:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:41:26" (3/3) ... [2022-04-28 02:41:26,328 INFO L111 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2022-04-28 02:41:26,338 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:41:26,339 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:41:26,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:41:26,411 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41d5227, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@691a2bd8 [2022-04-28 02:41:26,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:41:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 02:41:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 02:41:26,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:26,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:26,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:26,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385099, now seen corresponding path program 1 times [2022-04-28 02:41:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042942003] [2022-04-28 02:41:26,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385099, now seen corresponding path program 2 times [2022-04-28 02:41:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:26,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427192347] [2022-04-28 02:41:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {159#true} is VALID [2022-04-28 02:41:26,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 02:41:26,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #593#return; {159#true} is VALID [2022-04-28 02:41:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 02:41:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:26,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2022-04-28 02:41:26,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume !true; {160#false} is VALID [2022-04-28 02:41:26,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#false} assume true; {160#false} is VALID [2022-04-28 02:41:26,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160#false} {159#true} #539#return; {160#false} is VALID [2022-04-28 02:41:26,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:26,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {159#true} is VALID [2022-04-28 02:41:26,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 02:41:26,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #593#return; {159#true} is VALID [2022-04-28 02:41:26,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret31 := main(); {159#true} is VALID [2022-04-28 02:41:26,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {159#true} is VALID [2022-04-28 02:41:26,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {159#true} call gl_read(); {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 02:41:26,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {169#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {159#true} is VALID [2022-04-28 02:41:26,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#true} assume !true; {160#false} is VALID [2022-04-28 02:41:26,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {160#false} assume true; {160#false} is VALID [2022-04-28 02:41:26,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {160#false} {159#true} #539#return; {160#false} is VALID [2022-04-28 02:41:26,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#false} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {160#false} is VALID [2022-04-28 02:41:26,723 INFO L272 TraceCheckUtils]: 12: Hoare triple {160#false} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {160#false} is VALID [2022-04-28 02:41:26,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {160#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {160#false} is VALID [2022-04-28 02:41:26,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 02:41:26,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {160#false} assume ~head.base == 0 && ~head.offset == 0; {160#false} is VALID [2022-04-28 02:41:26,724 INFO L272 TraceCheckUtils]: 16: Hoare triple {160#false} call fail(); {160#false} is VALID [2022-04-28 02:41:26,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 02:41:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:26,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427192347] [2022-04-28 02:41:26,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427192347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:26,729 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:26,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042942003] [2022-04-28 02:41:26,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042942003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:26,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:26,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:41:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431860988] [2022-04-28 02:41:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 02:41:26,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:26,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 02:41:26,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:26,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:41:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:26,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:41:26,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:41:26,776 INFO L87 Difference]: Start difference. First operand has 156 states, 108 states have (on average 1.6574074074074074) internal successors, (179), 127 states have internal predecessors, (179), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 02:41:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:27,607 INFO L93 Difference]: Finished difference Result 331 states and 501 transitions. [2022-04-28 02:41:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:41:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 02:41:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 02:41:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 02:41:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 02:41:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 02:41:27,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 02:41:28,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:28,201 INFO L225 Difference]: With dead ends: 331 [2022-04-28 02:41:28,201 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 02:41:28,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 02:41:28,210 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 255 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:28,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 142 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 02:41:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 02:41:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2022-04-28 02:41:28,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:28,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:28,261 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:28,261 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:28,275 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2022-04-28 02:41:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2022-04-28 02:41:28,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:28,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:28,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-28 02:41:28,285 INFO L87 Difference]: Start difference. First operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-28 02:41:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:28,296 INFO L93 Difference]: Finished difference Result 164 states and 196 transitions. [2022-04-28 02:41:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2022-04-28 02:41:28,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:28,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:28,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:28,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 117 states have internal predecessors, (121), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 166 transitions. [2022-04-28 02:41:28,305 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 166 transitions. Word has length 18 [2022-04-28 02:41:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:28,305 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 166 transitions. [2022-04-28 02:41:28,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 02:41:28,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 166 transitions. [2022-04-28 02:41:28,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 166 transitions. [2022-04-28 02:41:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 02:41:28,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:28,480 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:28,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:41:28,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2112592059, now seen corresponding path program 1 times [2022-04-28 02:41:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036942949] [2022-04-28 02:41:28,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2112592059, now seen corresponding path program 2 times [2022-04-28 02:41:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:28,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892288443] [2022-04-28 02:41:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:28,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:41:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {1456#(= |~#gl_list~0.base| 5)} assume true; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1456#(= |~#gl_list~0.base| 5)} {1451#true} #593#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 02:41:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 02:41:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-28 02:41:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-28 02:41:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:41:28,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1451#true} is VALID [2022-04-28 02:41:28,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 02:41:28,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 02:41:28,866 INFO L272 TraceCheckUtils]: 1: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1451#true} is VALID [2022-04-28 02:41:28,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,866 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 02:41:28,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,866 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 02:41:28,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 02:41:28,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 02:41:28,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1451#true} is VALID [2022-04-28 02:41:28,884 INFO L272 TraceCheckUtils]: 3: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 02:41:28,885 INFO L272 TraceCheckUtils]: 5: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 02:41:28,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1451#true} is VALID [2022-04-28 02:41:28,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,887 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 02:41:28,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {1451#true} is VALID [2022-04-28 02:41:28,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 02:41:28,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {1451#true} assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp~1 := #t~nondet21;havoc #t~nondet21; {1451#true} is VALID [2022-04-28 02:41:28,888 INFO L272 TraceCheckUtils]: 3: Hoare triple {1451#true} call gl_insert(~tmp~1); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 02:41:28,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 02:41:28,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 02:41:28,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1451#true} is VALID [2022-04-28 02:41:28,889 INFO L272 TraceCheckUtils]: 7: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L272 TraceCheckUtils]: 9: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 02:41:28,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___0~0 := #t~nondet22;havoc #t~nondet22; {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#true} assume !(0 != ~tmp___0~0); {1451#true} is VALID [2022-04-28 02:41:28,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,893 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1451#true} {1456#(= |~#gl_list~0.base| 5)} #539#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {1451#true} call ULTIMATE.init(); {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:41:28,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#(and (= |~#gl_list~0.base| |old(~#gl_list~0.base)|) (= |~#gl_list~0.offset| |old(~#gl_list~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(2, 3);call write~init~int(48, 3, 0, 1);call write~init~int(0, 3, 1, 1);call #Ultimate.allocInit(12, 4);~#gl_list~0.base, ~#gl_list~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, ~#gl_list~0.offset, 4);call write~init~$Pointer$(~#gl_list~0.base, ~#gl_list~0.offset, ~#gl_list~0.base, 4 + ~#gl_list~0.offset, 4); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1456#(= |~#gl_list~0.base| 5)} assume true; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1456#(= |~#gl_list~0.base| 5)} {1451#true} #593#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {1456#(= |~#gl_list~0.base| 5)} call #t~ret31 := main(); {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {1456#(= |~#gl_list~0.base| 5)} havoc ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset;havoc ~__cil_tmp2~1.base, ~__cil_tmp2~1.offset; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1456#(= |~#gl_list~0.base| 5)} call gl_read(); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 02:41:28,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~tmp~1;havoc ~tmp___0~0; {1451#true} is VALID [2022-04-28 02:41:28,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 02:41:28,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1451#true} assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;~tmp~1 := #t~nondet21;havoc #t~nondet21; {1451#true} is VALID [2022-04-28 02:41:28,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {1451#true} call gl_insert(~tmp~1); {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-28 02:41:28,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~value := #in~value;havoc ~node~1.base, ~node~1.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~__cil_tmp4~4;havoc ~__cil_tmp5~3;havoc ~__cil_tmp6~3;havoc ~__cil_tmp7~2.base, ~__cil_tmp7~2.offset;havoc ~__cil_tmp8~1;havoc ~__cil_tmp9~1;havoc ~__cil_tmp10~1;havoc ~__cil_tmp11~1;havoc ~__cil_tmp12~1;havoc ~__cil_tmp13~1;havoc ~__cil_tmp14~1;havoc ~__cil_tmp15~1;~__cil_tmp4~4 := 20;call #t~malloc20.base, #t~malloc20.offset := #Ultimate.allocOnHeap(~__cil_tmp4~4);~tmp~0.base, ~tmp~0.offset := #t~malloc20.base, #t~malloc20.offset;havoc #t~malloc20.base, #t~malloc20.offset;~node~1.base, ~node~1.offset := ~tmp~0.base, ~tmp~0.offset; {1451#true} is VALID [2022-04-28 02:41:28,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1451#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {1451#true} is VALID [2022-04-28 02:41:28,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {1451#true} call write~int(~value, ~node~1.base, ~node~1.offset, 4);~__cil_tmp5~3 := ~node~1.base + ~node~1.offset;~__cil_tmp6~3 := 4 + ~__cil_tmp5~3;~__cil_tmp7~2.base, ~__cil_tmp7~2.offset := 0, (if ~__cil_tmp6~3 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp6~3 % 4294967296 % 4294967296 else ~__cil_tmp6~3 % 4294967296 % 4294967296 - 4294967296); {1451#true} is VALID [2022-04-28 02:41:28,898 INFO L272 TraceCheckUtils]: 14: Hoare triple {1451#true} call list_add(~__cil_tmp7~2.base, ~__cil_tmp7~2.offset, ~#gl_list~0.base, ~#gl_list~0.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset;call #t~mem17.base, #t~mem17.offset := read~$Pointer$(~head.base, ~head.offset, 4);~__cil_tmp3~2.base, ~__cil_tmp3~2.offset := #t~mem17.base, #t~mem17.offset;havoc #t~mem17.base, #t~mem17.offset; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#true} call __list_add(~new.base, ~new.offset, ~head.base, ~head.offset, ~__cil_tmp3~2.base, ~__cil_tmp3~2.offset); {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-04-28 02:41:28,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {1507#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~prev.base, ~prev.offset := #in~prev.base, #in~prev.offset;~next.base, ~next.offset := #in~next.base, #in~next.offset;havoc ~__cil_tmp4~1;havoc ~__cil_tmp5~1;havoc ~__cil_tmp6~1;havoc ~__cil_tmp7~1;~__cil_tmp4~1 := ~next.base + ~next.offset;~__cil_tmp5~1 := 4 + ~__cil_tmp4~1;call write~$Pointer$(~new.base, ~new.offset, 0, (if ~__cil_tmp5~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp5~1 % 4294967296 % 4294967296 else ~__cil_tmp5~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~next.base, ~next.offset, ~new.base, ~new.offset, 4);~__cil_tmp6~1 := ~new.base + ~new.offset;~__cil_tmp7~1 := 4 + ~__cil_tmp6~1;call write~$Pointer$(~prev.base, ~prev.offset, 0, (if ~__cil_tmp7~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp7~1 % 4294967296 % 4294967296 else ~__cil_tmp7~1 % 4294967296 % 4294967296 - 4294967296), 4);call write~$Pointer$(~new.base, ~new.offset, ~prev.base, ~prev.offset, 4); {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1451#true} {1451#true} #591#return; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1451#true} {1451#true} #597#return; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {1451#true} assume !false; {1451#true} is VALID [2022-04-28 02:41:28,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {1451#true} ~__cil_tmp8~1 := ~node~1.base + ~node~1.offset;~__cil_tmp9~1 := 12 + ~__cil_tmp8~1;~__cil_tmp10~1 := ~node~1.base + ~node~1.offset;~__cil_tmp11~1 := 12 + ~__cil_tmp10~1;call write~$Pointer$(0, (if ~__cil_tmp11~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp11~1 % 4294967296 % 4294967296 else ~__cil_tmp11~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp9~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp9~1 % 4294967296 % 4294967296 else ~__cil_tmp9~1 % 4294967296 % 4294967296 - 4294967296), 4);~__cil_tmp12~1 := ~node~1.base + ~node~1.offset;~__cil_tmp13~1 := 12 + ~__cil_tmp12~1;~__cil_tmp14~1 := ~node~1.base + ~node~1.offset;~__cil_tmp15~1 := 12 + ~__cil_tmp14~1;call write~$Pointer$(0, (if ~__cil_tmp15~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp15~1 % 4294967296 % 4294967296 else ~__cil_tmp15~1 % 4294967296 % 4294967296 - 4294967296), 0, (if ~__cil_tmp13~1 % 4294967296 % 4294967296 <= 2147483647 then ~__cil_tmp13~1 % 4294967296 % 4294967296 else ~__cil_tmp13~1 % 4294967296 % 4294967296 - 4294967296), 4); {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1451#true} {1451#true} #555#return; {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {1451#true} assume -2147483648 <= #t~nondet22 && #t~nondet22 <= 2147483647;~tmp___0~0 := #t~nondet22;havoc #t~nondet22; {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {1451#true} assume !(0 != ~tmp___0~0); {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {1451#true} assume true; {1451#true} is VALID [2022-04-28 02:41:28,901 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1451#true} {1456#(= |~#gl_list~0.base| 5)} #539#return; {1456#(= |~#gl_list~0.base| 5)} is VALID [2022-04-28 02:41:28,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {1456#(= |~#gl_list~0.base| 5)} ~__cil_tmp1~0.base, ~__cil_tmp1~0.offset := ~#gl_list~0.base, ~#gl_list~0.offset; {1480#(= 5 main_~__cil_tmp1~0.base)} is VALID [2022-04-28 02:41:28,902 INFO L272 TraceCheckUtils]: 31: Hoare triple {1480#(= 5 main_~__cil_tmp1~0.base)} call inspect(~__cil_tmp1~0.base, ~__cil_tmp1~0.offset); {1481#(= |inspect_#in~head.base| 5)} is VALID [2022-04-28 02:41:28,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {1481#(= |inspect_#in~head.base| 5)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;havoc ~node~0.base, ~node~0.offset;havoc ~__cil_tmp3~0;havoc ~__cil_tmp4~0.base, ~__cil_tmp4~0.offset;havoc ~__cil_tmp5~0;havoc ~__cil_tmp6~0;havoc ~__cil_tmp7~0;havoc ~__cil_tmp8~0;havoc ~__cil_tmp9~0;havoc ~__cil_tmp10~0.base, ~__cil_tmp10~0.offset;havoc ~__cil_tmp11~0;havoc ~__cil_tmp12~0;havoc ~__cil_tmp13~0;havoc ~__cil_tmp14~0;havoc ~__cil_tmp15~0.base, ~__cil_tmp15~0.offset;havoc ~__cil_tmp16~0;havoc ~__cil_tmp17~0.base, ~__cil_tmp17~0.offset;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;havoc ~__cil_tmp20~0;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~0.base, ~__cil_tmp23~0.offset;havoc ~__cil_tmp24~0;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0.base, ~__cil_tmp26~0.offset;havoc ~__cil_tmp27~0;havoc ~__cil_tmp28~0;havoc ~__cil_tmp29~0.base, ~__cil_tmp29~0.offset;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0.base, ~__cil_tmp31~0.offset;havoc ~__cil_tmp32~0.base, ~__cil_tmp32~0.offset;havoc ~__cil_tmp33~0.base, ~__cil_tmp33~0.offset;havoc ~__cil_tmp34~0;havoc ~__cil_tmp35~0;havoc ~__cil_tmp36~0.base, ~__cil_tmp36~0.offset;havoc ~__cil_tmp37~0;havoc ~__cil_tmp38~0;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0.base, ~__cil_tmp40~0.offset;havoc ~__cil_tmp41~0;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;havoc ~__cil_tmp44~0;havoc ~__cil_tmp45~0.base, ~__cil_tmp45~0.offset;havoc ~__cil_tmp46~0;havoc ~__cil_tmp47~0;havoc ~__cil_tmp48~0;havoc ~__cil_tmp49~0;havoc ~__cil_tmp50~0.base, ~__cil_tmp50~0.offset;havoc ~__cil_tmp51~0;havoc ~__cil_tmp52~0;havoc ~__cil_tmp53~0;havoc ~__cil_tmp54~0;havoc ~__cil_tmp55~0.base, ~__cil_tmp55~0.offset;havoc ~__cil_tmp56~0;havoc ~__cil_tmp57~0;havoc ~__cil_tmp58~0;havoc ~__cil_tmp59~0.base, ~__cil_tmp59~0.offset;havoc ~__cil_tmp60~0;havoc ~__cil_tmp61~0;havoc ~__cil_tmp62~0;havoc ~__cil_tmp63~0;havoc ~__cil_tmp64~0.base, ~__cil_tmp64~0.offset;havoc ~__cil_tmp65~0;havoc ~__cil_tmp66~0;havoc ~__cil_tmp67~0;havoc ~__cil_tmp68~0;havoc ~__cil_tmp69~0.base, ~__cil_tmp69~0.offset;havoc ~__cil_tmp70~0;havoc ~__cil_tmp71~0;havoc ~__cil_tmp72~0.base, ~__cil_tmp72~0.offset;havoc ~__cil_tmp73~0;havoc ~__cil_tmp74~0;havoc ~__cil_tmp75~0;havoc ~__cil_tmp76~0;havoc ~__cil_tmp77~0;havoc ~__cil_tmp78~0.base, ~__cil_tmp78~0.offset;havoc ~__cil_tmp79~0.base, ~__cil_tmp79~0.offset;havoc ~__cil_tmp80~0;havoc ~__cil_tmp81~0;havoc ~__cil_tmp82~0;havoc ~__cil_tmp83~0.base, ~__cil_tmp83~0.offset;havoc ~__cil_tmp84~0.base, ~__cil_tmp84~0.offset;havoc ~__cil_tmp85~0;havoc ~__cil_tmp86~0;havoc ~__cil_tmp87~0;havoc ~__cil_tmp88~0;havoc ~__cil_tmp89~0;havoc ~__cil_tmp90~0.base, ~__cil_tmp90~0.offset;havoc ~__cil_tmp91~0;havoc ~__cil_tmp92~0;havoc ~__cil_tmp93~0.base, ~__cil_tmp93~0.offset;havoc ~__cil_tmp94~0;havoc ~__cil_tmp95~0;havoc ~__cil_tmp96~0;havoc ~__cil_tmp97~0;havoc ~__cil_tmp98~0;havoc ~__cil_tmp99~0;havoc ~__cil_tmp100~0.base, ~__cil_tmp100~0.offset;havoc ~__cil_tmp101~0.base, ~__cil_tmp101~0.offset;havoc ~__cil_tmp102~0;havoc ~__cil_tmp103~0;havoc ~__cil_tmp104~0;havoc ~__cil_tmp105~0.base, ~__cil_tmp105~0.offset;havoc ~__cil_tmp106~0;havoc ~__cil_tmp107~0;havoc ~__cil_tmp108~0;havoc ~__cil_tmp109~0.base, ~__cil_tmp109~0.offset;havoc ~__cil_tmp110~0;havoc ~__cil_tmp111~0.base, ~__cil_tmp111~0.offset;havoc ~__cil_tmp112~0;havoc ~__cil_tmp113~0.base, ~__cil_tmp113~0.offset;havoc ~__cil_tmp114~0;havoc ~__cil_tmp115~0;havoc ~__cil_tmp116~0.base, ~__cil_tmp116~0.offset;havoc ~__cil_tmp117~0;havoc ~__cil_tmp118~0.base, ~__cil_tmp118~0.offset;havoc ~__cil_tmp119~0.base, ~__cil_tmp119~0.offset;havoc ~__cil_tmp120~0.base, ~__cil_tmp120~0.offset;havoc ~__cil_tmp121~0;havoc ~__cil_tmp122~0; {1482#(= 5 inspect_~head.base)} is VALID [2022-04-28 02:41:28,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {1482#(= 5 inspect_~head.base)} assume !false; {1482#(= 5 inspect_~head.base)} is VALID [2022-04-28 02:41:28,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {1482#(= 5 inspect_~head.base)} assume ~head.base == 0 && ~head.offset == 0; {1452#false} is VALID [2022-04-28 02:41:28,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {1452#false} call fail(); {1452#false} is VALID [2022-04-28 02:41:28,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {1452#false} assume !false; {1452#false} is VALID [2022-04-28 02:41:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:41:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:41:28,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892288443] [2022-04-28 02:41:28,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892288443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:28,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:28,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:28,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:41:28,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036942949] [2022-04-28 02:41:28,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036942949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:41:28,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:41:28,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:41:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126432864] [2022-04-28 02:41:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:41:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 02:41:28,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:41:28,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 02:41:28,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:28,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:41:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:28,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:41:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:41:28,945 INFO L87 Difference]: Start difference. First operand 143 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 02:41:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,207 INFO L93 Difference]: Finished difference Result 241 states and 289 transitions. [2022-04-28 02:41:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:41:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 02:41:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:41:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 02:41:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-04-28 02:41:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 02:41:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 289 transitions. [2022-04-28 02:41:31,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 289 transitions. [2022-04-28 02:41:31,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,532 INFO L225 Difference]: With dead ends: 241 [2022-04-28 02:41:31,532 INFO L226 Difference]: Without dead ends: 236 [2022-04-28 02:41:31,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:41:31,534 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 02:41:31,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 134 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 02:41:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-28 02:41:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 199. [2022-04-28 02:41:31,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:41:31,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:31,554 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:31,554 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,564 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2022-04-28 02:41:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-04-28 02:41:31,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-04-28 02:41:31,567 INFO L87 Difference]: Start difference. First operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-04-28 02:41:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:41:31,577 INFO L93 Difference]: Finished difference Result 236 states and 284 transitions. [2022-04-28 02:41:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 284 transitions. [2022-04-28 02:41:31,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:41:31,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:41:31,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:41:31,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:41:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 172 states have internal predecessors, (193), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 02:41:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 238 transitions. [2022-04-28 02:41:31,587 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 238 transitions. Word has length 37 [2022-04-28 02:41:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:41:31,587 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 238 transitions. [2022-04-28 02:41:31,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 02:41:31,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 238 transitions. [2022-04-28 02:41:31,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:41:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 238 transitions. [2022-04-28 02:41:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 02:41:31,840 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:41:31,840 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:41:31,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:41:31,840 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:41:31,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:41:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1799360915, now seen corresponding path program 1 times [2022-04-28 02:41:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:41:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454314697] [2022-04-28 02:41:31,841 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:41:31,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1799360915, now seen corresponding path program 2 times [2022-04-28 02:41:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:41:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490161327] [2022-04-28 02:41:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:41:31,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:41:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:31,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:41:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:41:32,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:41:32,077 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 02:41:32,077 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 02:41:32,080 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 02:41:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:41:32,083 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 02:41:32,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: __list_addENTRY has no Hoare annotation [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: val_from_nodeENTRY has no Hoare annotation [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: gl_sort_passENTRY has no Hoare annotation [2022-04-28 02:41:32,110 WARN L170 areAnnotationChecker]: gl_sortENTRY has no Hoare annotation [2022-04-28 02:41:32,111 WARN L170 areAnnotationChecker]: __list_delENTRY has no Hoare annotation [2022-04-28 02:41:32,111 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: gl_readENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: gl_destroyENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: list_moveENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: inspectENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: list_addENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: gl_insertENTRY has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: __list_addFINAL has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: val_from_nodeFINAL has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L807-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L824-1 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: __list_delFINAL has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L839 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L839 has no Hoare annotation [2022-04-28 02:41:32,115 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L687-1 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L714-2 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L179loopEntry has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L599 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L642 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L642 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: __list_addEXIT has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: val_from_nodeEXIT has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: val_from_nodeEXIT has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L810 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L802 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L829 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L820 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L820 has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: __list_delEXIT has no Hoare annotation [2022-04-28 02:41:32,116 WARN L170 areAnnotationChecker]: L839-1 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L692 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L681 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L741 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L715 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L615-1 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L615-1 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: list_addFINAL has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L642-2 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L795 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L797-1 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: gl_sort_passFINAL has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L789 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L789 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: gl_sortEXIT has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L822 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L841 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L841 has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: gl_readEXIT has no Hoare annotation [2022-04-28 02:41:32,117 WARN L170 areAnnotationChecker]: L684 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L684 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: gl_destroyEXIT has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L721 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L721 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: list_moveFINAL has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L208 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L653 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L653 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L797 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L797 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L800 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L800 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: gl_sort_passEXIT has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L789-1 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L789-1 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L824 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L841-1 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L841-1 has no Hoare annotation [2022-04-28 02:41:32,118 WARN L170 areAnnotationChecker]: L684-1 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L845 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L721-1 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: list_moveEXIT has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L653-1 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L807 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L807 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L844 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L844 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L687 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L687 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L236loopEntry has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L670 has no Hoare annotation [2022-04-28 02:41:32,119 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L844-1 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L844-1 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L246 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: gl_insertEXIT has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L286 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L256 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L298loopEntry has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-28 02:41:32,120 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L258 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L299 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L299 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L312 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L357 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L336 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L323 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L381 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L348 has no Hoare annotation [2022-04-28 02:41:32,121 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L406 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L350 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L425 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L410 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L397 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L397 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L447 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L429 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L416 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L399 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 02:41:32,122 WARN L170 areAnnotationChecker]: L467 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L451 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L438 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L438 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L418 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L491 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L471 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L458 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L440 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L495 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L482 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L460 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L460 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L519-2 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-04-28 02:41:32,123 WARN L170 areAnnotationChecker]: L484 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L535 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L520 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L507 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L507 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L527 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: inspectEXIT has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: inspectEXIT has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L527-1 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-04-28 02:41:32,124 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2022-04-28 02:41:32,124 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 02:41:32,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 02:41:32 BoogieIcfgContainer [2022-04-28 02:41:32,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 02:41:32,127 INFO L158 Benchmark]: Toolchain (without parser) took 7054.53ms. Allocated memory was 204.5MB in the beginning and 337.6MB in the end (delta: 133.2MB). Free memory was 180.1MB in the beginning and 168.0MB in the end (delta: 12.2MB). Peak memory consumption was 144.8MB. Max. memory is 8.0GB. [2022-04-28 02:41:32,131 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:41:32,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.02ms. Allocated memory is still 204.5MB. Free memory was 180.1MB in the beginning and 169.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-28 02:41:32,133 INFO L158 Benchmark]: Boogie Preprocessor took 101.40ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 164.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-28 02:41:32,133 INFO L158 Benchmark]: RCFGBuilder took 804.96ms. Allocated memory is still 204.5MB. Free memory was 164.1MB in the beginning and 124.6MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-04-28 02:41:32,135 INFO L158 Benchmark]: TraceAbstraction took 5809.55ms. Allocated memory was 204.5MB in the beginning and 337.6MB in the end (delta: 133.2MB). Free memory was 123.9MB in the beginning and 168.0MB in the end (delta: -44.1MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. [2022-04-28 02:41:32,136 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 204.5MB. Free memory is still 168.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 335.02ms. Allocated memory is still 204.5MB. Free memory was 180.1MB in the beginning and 169.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 101.40ms. Allocated memory is still 204.5MB. Free memory was 169.3MB in the beginning and 164.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 804.96ms. Allocated memory is still 204.5MB. Free memory was 164.1MB in the beginning and 124.6MB in the end (delta: 39.5MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5809.55ms. Allocated memory was 204.5MB in the beginning and 337.6MB in the end (delta: 133.2MB). Free memory was 123.9MB in the beginning and 168.0MB in the end (delta: -44.1MB). Peak memory consumption was 90.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; [L680] COND TRUE 1 [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp [L642] COND FALSE !(! node) [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 [L653] CALL list_add(__cil_tmp7, & gl_list) [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) [L656] COND TRUE 1 [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) [L841] CALL inspect(__cil_tmp1) [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; [L179] COND TRUE 1 [L181] COND FALSE !(! head) [L192] COND TRUE 1 [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 [L199] COND TRUE ! __cil_tmp6 [L201] CALL fail() [L46] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 937 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 923 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 760 IncrementalHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 267 mSDtfsCounter, 760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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! [2022-04-28 02:41:32,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...